A small trivalent graph of girth 14.
Exoo, Geoffrey (2002)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Exoo, Geoffrey (2002)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Al-Addasi, Salah, Al-Ezeh, Hasan (2008)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Manju K. Menon, A. Vijayakumar (2010)
Discussiones Mathematicae Graph Theory
Similarity:
The edge C₄ graph of a graph G, E₄(G) is a graph whose vertices are the edges of G and two vertices in E₄(G) are adjacent if the corresponding edges in G are either incident or are opposite edges of some C₄. In this paper, we show that there exist infinitely many pairs of non isomorphic graphs whose edge C₄ graphs are isomorphic. We study the relationship between the diameter, radius and domination number of G and those of E₄(G). It is shown that for any graph G without isolated vertices,...
Girse, Robert D. (1986)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Zaslavsky, Thomas (1998)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Hajiabolhassan, Hossein, Taherkhani, Ali (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Ferdinand Gliviak, Peter Kyš, Ján Plesník (1969)
Matematický časopis
Similarity:
Pavol Híc (1992)
Mathematica Slovaca
Similarity: