A small trivalent graph of girth 14.
Exoo, Geoffrey (2002)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Displaying similar documents to “The remarkable generalized Petersen graph ”
A small trivalent graph of girth 14.
A generalization of the friendship theorem
Marián Sudolský (1978)
Mathematica Slovaca
Similarity:
A note on randomly complete -partite graphs
Pavol Híc (1992)
Mathematica Slovaca
Similarity:
Regularity and Planarity of Token Graphs
Walter Carballosa, Ruy Fabila-Monroy, Jesús Leaños, Luis Manuel Rivera (2017)
Discussiones Mathematicae Graph Theory
Similarity:
Let G = (V, E) be a graph of order n and let 1 ≤ k < n be an integer. The k-token graph of G is the graph whose vertices are all the k-subsets of V, two of which are adjacent whenever their symmetric difference is a pair of adjacent vertices in G. In this paper we characterize precisely, for each value of k, which graphs have a regular k-token graph and which connected graphs have a planar k-token graph.
Combinatorial labelings of graphs.
Hegde, Suresh Manjanath, Shetty, Sudhakar (2006)
Applied Mathematics E-Notes [electronic only]
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.