期刊文献+

Super Cyclically Edge-connected Vertex-transitive Graphs of Girth at Least 5

Super Cyclically Edge-connected Vertex-transitive Graphs of Girth at Least 5
原文传递
导出
摘要 A cyclic edge-cut of a graph G is an edge set, the removal of which separates two cycles. If G has a cyclic edge-cut, then it is called cyclically separable. We call a cyclically separable graph super cyclically edge-connected, in short, super-λc, if the removal of any minimum cyclic edge-cut results in a component which is a shortest cycle. In [Zhang, Z., Wang, B.: Super cyclically edge-connected transitive graphs. J. Combin. Optim., 22, 549–562 (2011)], it is proved that a connected vertex-transitive graph is super-λc if G has minimum degree at least 4 and girth at least 6, and the authors also presented a class of nonsuper-λc graphs which have degree 4 and girth 5. In this paper, a characterization of k (k≥4)-regular vertex-transitive nonsuper-λc graphs of girth 5 is given. Using this, we classify all k (k≥4)-regular nonsuper-λc Cayley graphs of girth 5, and construct the first infinite family of nonsuper-λc vertex-transitive non-Cayley graphs. A cyclic edge-cut of a graph G is an edge set, the removal of which separates two cycles. If G has a cyclic edge-cut, then it is called cyclically separable. We call a cyclically separable graph super cyclically edge-connected, in short, super-λc, if the removal of any minimum cyclic edge-cut results in a component which is a shortest cycle. In [Zhang, Z., Wang, B.: Super cyclically edge-connected transitive graphs. J. Combin. Optim., 22, 549–562 (2011)], it is proved that a connected vertex-transitive graph is super-λc if G has minimum degree at least 4 and girth at least 6, and the authors also presented a class of nonsuper-λc graphs which have degree 4 and girth 5. In this paper, a characterization of k (k≥4)-regular vertex-transitive nonsuper-λc graphs of girth 5 is given. Using this, we classify all k (k≥4)-regular nonsuper-λc Cayley graphs of girth 5, and construct the first infinite family of nonsuper-λc vertex-transitive non-Cayley graphs.
出处 《Acta Mathematica Sinica,English Series》 SCIE CSCD 2013年第8期1569-1580,共12页 数学学报(英文版)
基金 supported by National Natural Science Foundation of China (Grant No.11271012) the Fundamental Research Funds for the Central Universities (Grant Nos.2011JBM127,2011JBZ012) supported by National Natural Science Foundation of China (Grant No.11101035) the Subsidy for Outstanding People of Beijing (Grant No.2011D005022000005)
关键词 Cyclic edge-cut cyclic edge-connectivity super cyclically edge-connected vertex-transit-ive graphs Cyclic edge-cut cyclic edge-connectivity super cyclically edge-connected vertex-transit-ive graphs
  • 相关文献

参考文献2

二级参考文献13

  • 1XUMINGYAO,ZHANGQINHAI,ZHOUJINXIN.ARC-TRANSITIVE CUBIC GRAPHS OF ORDER 4_p[J].Chinese Annals of Mathematics,Series B,2004,25(4):545-554. 被引量:3
  • 2Watkins, M.E., A theorem on Tait colorings with an application to the generalized Petersen graphs, J. Combin. Theory, 1969, 6: 152-164. 被引量:1
  • 3Marusic, D., Cayley properties of vertex symmetric graphs, Ars Combin. Set.B, 1983, 16: 297-302. 被引量:1
  • 4Marusic, D., Vertex transitive graphs and digraphs of order p^k, Ann. Discrete Math., 1985, 27: 115-128. 被引量:1
  • 5McKay, B.D., Praeger, C.E, Vertex-transitive graphs which are not Cayley graphs I, J. Austral. Math. Soc. Ser.A, 1994, 56: 53-63. 被引量:1
  • 6McKay, B.D., Praeger, C.E., Vertex-transitive graphs which are not Cayley graphs Ⅱ, J. Graph Theory, 1996, 22: 321-334. 被引量:1
  • 7Miller, A.A., Praeger, C.E., Non-Cayley vertex-transitive graphs of order twice the product two odd primes, J. Algebra Combin., 1994, 3; 77-111. 被引量:1
  • 8Sarazin, M.L., A note on the generalized Petersen graph that are also Cayley graph, J. Combin. Theory Ser.B, 1997, 69: 226-229. 被引量:1
  • 9Nedela, R., Skoviera, M., Which generalized Petersen graphs are not Cayley graphs? J. Graph Theory, 1995, 19: 1-11. 被引量:1
  • 10Seress, A., On vertex-transitive non-Cayley graphs of order pqr, Discrete Math., 1998, 182: 279-292. 被引量:1

共引文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部