【摘 要】
：
Anti-Kekulé problem is a concept of chemical graph theory precluding the Kekulé structure of the molecules.Matching preclusion and conditional matching pr
【机 构】
：
UniversityofElectronicScienceandTechnologyofChinaChengdu,P.R.China
【出 处】
：
第六届图论与组合算法国际研讨会(The 6th International Symposium on Graph The
论文部分内容阅读
Anti-Kekulé problem is a concept of chemical graph theory precluding the Kekulé structure of the molecules.Matching preclusion and conditional matching preclusion were proposed as measures of robustness in the event of edge failure in interconnection networks.
其他文献
A total-[k]-coloring of a graph G is a mappingφ:V(G)∪E(G)→ {1,2,…,k} such that any two adjacent elements in V(G)∪E(G)receive di erent colors.
A graph G is hypohamiltonian if it is not Hamiltonian but for each v∈V(G),G-v is Hamiltonian.A graph is supereulerian if it has a spanning Eulerian subgrap
Let G be a 2-edge-connected simple graph on n≥14 vetices,and let A denote an abelian group with the identity element 0.If a graph G* is obtained by repeate
Interconnection network is important for parallel processing which have been developed on cycle-embedding or path-embedding.Since failure may occur when a n
Pólyas problem concerns the conversion of the permanent and determinant of a matrix.As a generalization of this problem,this topic focus on the conversion
Given a graph H,what is the maximum number of edges of a graph with n vertices not containing H as a subgraph? This number is denoted ex(n,H),and is known a
Let A1,…,Ak be families of distinct subsets of [n].These families are incomparable if no set in one family is contained in a set in another family.A family
In this talk,we shall introduce some results on judicious k-partitions of graphs,which improve the main results of [B,Xu,X.Yu,Better bounds for k-partitions
Clustering algorithms for unsigned networks which have only positive edges have been studied intensively.However,when a network has like/dislike,love/hate,r
A gc-coloring of a graph G is an edge-coloring of G such that each color appears at each vertex at least g(v)times.The maximum integer k such that G has a g