Finite planar vertex-transitive graphs of the regularity degree three
Bohdan Zelinka (1977)
Časopis pro pěstování matematiky
Similarity:
Bohdan Zelinka (1977)
Časopis pro pěstování matematiky
Similarity:
Herbert Fleischner, Wilfried Imrich (1979)
Mathematica Slovaca
Similarity:
Bender, Edward A., Gao, Zhicheng, Wormald, Nicholas C. (2002)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Italo J. Dejter (2015)
Discussiones Mathematicae Graph Theory
Similarity:
Let Γn be the complete undirected Cayley graph of the odd cyclic group Zn. Connected graphs whose vertices are rainbow tetrahedra in Γn are studied, with any two such vertices adjacent if and only if they share (as tetrahedra) precisely two distinct triangles. This yields graphs G of largest degree 6, asymptotic diameter |V (G)|1/3 and almost all vertices with degree: (a) 6 in G; (b) 4 in exactly six connected subgraphs of the (3, 6, 3, 6)-semi- regular tessellation; and (c) 3 in exactly...
Gera, Ralucca, Shen, Jian (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Pokrovskiy, A. (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
M. Tavakoli, F. Rahbarnia, M. Mirzavaziri, A. R. Ashrafi, I. Gutman (2013)
Kragujevac Journal of Mathematics
Similarity:
Chandrashekar Adiga, B.R. Rakshith (2016)
Discussiones Mathematicae Graph Theory
Similarity:
Let G and H be two graphs. The join G ∨ H is the graph obtained by joining every vertex of G with every vertex of H. The corona G ○ H is the graph obtained by taking one copy of G and |V (G)| copies of H and joining the i-th vertex of G to every vertex in the i-th copy of H. The neighborhood corona G★H is the graph obtained by taking one copy of G and |V (G)| copies of H and joining the neighbors of the i-th vertex of G to every vertex in the i-th copy of H. The edge corona G ◇ H is...