scholarly journals Strict Inequalities for Connective Constants of Transitive Graphs

2014 ◽  
Vol 28 (3) ◽  
pp. 1306-1333 ◽  
Author(s):  
Geoffrey R. Grimmett ◽  
Zhongyang Li
2008 ◽  
Vol 15 (03) ◽  
pp. 379-390 ◽  
Author(s):  
Xuesong Ma ◽  
Ruji Wang

Let X be a simple undirected connected trivalent graph. Then X is said to be a trivalent non-symmetric graph of type (II) if its automorphism group A = Aut (X) acts transitively on the vertices and the vertex-stabilizer Av of any vertex v has two orbits on the neighborhood of v. In this paper, such graphs of order at most 150 with the basic cycles of prime length are investigated, and a classification is given for such graphs which are non-Cayley graphs, whose block graphs induced by the basic cycles are non-bipartite graphs.


2010 ◽  
Vol 310 (4) ◽  
pp. 877-886 ◽  
Author(s):  
Fu-Tao Hu ◽  
Jian-Wei Wang ◽  
Jun-Ming Xu
Keyword(s):  

2007 ◽  
Vol 26 (4) ◽  
pp. 431-451 ◽  
Author(s):  
Yan-Quan Feng ◽  
Jin Ho Kwak ◽  
Chuixiang Zhou
Keyword(s):  

2012 ◽  
Vol 312 (24) ◽  
pp. 3643-3648
Author(s):  
Katja Berčič ◽  
Mohsen Ghasemi
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document