首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到9条相似文献,搜索用时 15 毫秒
1.
EDGERECONSTRUCTIONOFPLANARGRAPHSWITHMINIMUMDEGREEATLEASTTHREE-(Ⅱ)¥FANHongbing(DeportmentofMathematics,ShandongUniversity,Jina...  相似文献   

2.
EDGERECONSTRUCTIONOFPLANARGRAPHSWITHMINIMUMDEGREEATLEASTTHREE-(Ⅲ)¥FANHongbing(DepartmentofMathematics,ShandongUniversitg,Jina...  相似文献   

3.
1.IntroductionLetGbeafinitegroup.ForaCayleysubsetSofGnotcontainingtheidentityelement1,theCayley(di)graphX~Cay(G,S)ofGwithrespecttoSisdefinedasthedirectedgraphwithvertexsetV(X)=GandedgesetE(X)={(g,sg)IgEG,s6S}.IfS=S--',thentheadjacencyrelationissymmet...  相似文献   

4.
1. ResultsWe use[IJ for terminology and notations not defined here and consider simple graph only.Let G be a graph of order n and X C V(G). A graph G is called 1--tough if w(G\S) 5 ISIfor any S g V(G) with w(G\S) > 1, where w(G\S) denotes the number of components ofgraph G\S. A cycle C of G is called X-longest if no cycle of G contains more venices of Xthan C, and by c(X) we denote the number of venices of X in an X-longest cycle. A cycle Cof G is called X-dominating if all neigh…  相似文献   

5.
(4m, m)-CHOOSABILITY OF PLANE GRAPHS   总被引:3,自引:0,他引:3  
1 IntroductionAll graphs considered in tabs paper are abate and sable. Undecked notations and termalnologies can be found in [if.Let G = (V, E,F) be a plase graph, where V, E and F denote the s6t of venices, edgesand faces of G, respectively. We use NG(v) and dG(v) to denote the set and nUmber of venicesadjacent to a vertex yi respectively, and use 6(G) to denote the inininuun degree of G. A vertexv is called a k-vertex if v has degree k. A face of a plane graph is said to be incident w…  相似文献   

6.
THE NORMALITY OF CAYLEY GRAPHS OF FINITE ABELIAN GROUPS WITH VALENCY 5   总被引:6,自引:0,他引:6  
1. IntroductionLet G be a finite group and S a subset of G not colltaining the idelltity elemellt 1. TheCayley digraph X ~ Cay(G, S) of G on S is defined byV(X) = G, E(X) ~ {(g, sg)jg E G, s E S}.Immediately from the definition there are three obvious facts: (1) Ant(X), the automorphismgroup of X, contains the right regular representation GR of G; (2) X is connected if and onlyif G = (S}, (3) X is an undirected graph (by coalescing each pair (g, sg) and (sg, g) of directededges int…  相似文献   

7.
PATH EXTENSIBILITY OF CONNECTED,LOCALLY 2-CONNECTED K_(1,3)-FREE GRAPHS   总被引:2,自引:0,他引:2  
1.IntroductionandNotationqInthispaperswewillconsideronlyfinite,undirectedgraphs,withoutloopsandmultipleedges.Weusethenotationsandterminologyin[1].Inaddition,ifGisagraph,wedenotebyV(G)andE(G),respectively,thevertexsetandtheedgesetofG.ForanyaEV(G),ACV(G),BC…  相似文献   

8.
HAMILTONICITYIN2-CONNECTED{K_(1,3)F}-FREEGRAPHS¥LIGuojun(MathematicsDepertmentofYantaiTeacher'sCollege,Yantai264000,China)LIU?..  相似文献   

9.
PACKING A TREE OF ORDER p WITH A (p,p+1)—GRAPH   总被引:12,自引:0,他引:12  
Let G1 and G2 be two graphs of the same order,If G1 is isomorphic to a spanning subgraph of the complement of G2,then we say that G1 and G2 are packable.A graph G is called a (p,m)-graph if G has p vertices and m edges.The main purpose of this paper is to present a necessary and sufficient condition for a tree of order p and a (p,p 1)-graph to be packable.  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号