A small trivalent graph of girth 14.
Exoo, Geoffrey (2002)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Displaying similar documents to “Combinatorial labelings of graphs.”
A small trivalent graph of girth 14.
Bipartite diametrical graphs of diameter 4 and extreme orders.
Al-Addasi, Salah, Al-Ezeh, Hasan (2008)
International Journal of Mathematics and Mathematical Sciences
Similarity:
The edge C₄ graph of some graph classes
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,...
Homomorphisms of complete n-partite graphs.
Girse, Robert D. (1986)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Glossary of signed and gain graphs and allied areas.
Zaslavsky, Thomas (1998)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Graph powers and graph homomorphisms.
Hajiabolhassan, Hossein, Taherkhani, Ali (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On the Extension of Graphs with a Given Diameter without Superfluous Edges
Ferdinand Gliviak, Peter Kyš, Ján Plesník (1969)
Matematický časopis
Similarity:
A note on randomly complete -partite graphs
Pavol Híc (1992)
Mathematica Slovaca
Similarity:
Bipartite graphs that are not circle graphs
André Bouchet (1999)
Annales de l'institut Fourier
Similarity:
The following result is proved: if a bipartite graph is not a circle graph, then its complement is not a circle graph. The proof uses Naji’s characterization of circle graphs by means of a linear system of equations with unknowns in . At the end of this short note I briefly recall the work of François Jaeger on circle graphs.