论文部分内容阅读
若G中长为r+tj+i的圈恰好有pi(0≤i≤t-1)个,其中∑t-1i=0pi=t,r+tj+i-1≤n,则称G为r-(p0,…,pt-1)-泛圈图。本文主要采用构造法,给出当t=8时r-(p0,…,pt-1)-泛圈图的一些结果。
关于r-(p0,…,pt-1)-泛圈图
【摘 要】
：
若G中长为r+tj+i的圈恰好有pi(0≤i≤t-1)个,其中∑t-1i=0pi=t,r+tj+i-1≤n,则称G为r-(p0,…,pt-1)-泛圈图。本文主要采用构造法,给出当t=8时r-(p0,…,pt-1)-泛圈图的一
【机 构】
：
闽南师范大学,数学与统计学院,福建,漳州,363000
【出 处】
：
第六届图论与组合算法国际研讨会(The 6th International Symposium on Graph The
【发表日期】
：
2015年7期
其他文献
In this talk,I will introduce some results on enumeration of spanning trees of toroidal graphs.
会议
In this talk,we will introduce a general algebraic technique(Combinatorial Nullstellensatz)and its applications in graph colorings.We also mention a probabi
会议
分析了增广拉格朗日法乘子修正基本技术、交替方向法乘子修正技术分析、基于新的修正技术导出的几种乘子修正技术，可以深入探讨多分块优化问题ADMM的乘子修正优化技术。
For any integer m>0 and any real c,let f(m,c)=∑∞k=0(km+1)k-1cke-(km+1)c/k!.The identity f(m,/c=m)m=f(1,c)arises in the random graph theory.Here we present
会议
Let n and k be two positive integers satisfying n≥2k.Let A be an intersecting family of(C)([n]k).
会议
Graphs/digraphs of graph theory are naturally and vividly used to be models for understanding and simulating complex networks nowadays.We talk about some ph
会议
In this talk,we give Brualdi-type eigenvalue inclusion sets of tensors by using associated digraphs of tensors,and discuss some properties of Z-eigenvalues
会议
The arc-chromatic number of a digraph is the smallest number of colors required in an arc-coloring such that no two consecutive arcs get the same color.
会议
Graphs are frequently used by computer scientists as abstractions when modeling an application problem in networks.Cutting a graph into smaller pieces is on
会议
Let G be a graph and id(v) denote the implicit degree of a vertex v in G.An induced subgraph H of G is called f-implicit-heavy if max{id(x),id(y)}≥|V(G)|/2
会议