Minimal line graphs
Glasgow mathematical journal, Tome 17 (1976) no. 1, pp. 12-16
Voir la notice de l'article provenant de la source Cambridge University Press
In this paper all graphs will be ordinary graphs, i.e. finite, undirected, and without loops or multiple edges. For points x and y of a graph G, we shall indicate that x is adjacent to y by writing x ⊥ y, and if x is not adjacent to y we shall write xy. We shall denote the degree of a point x by δ(x) and the minimal degree of G by δ(G).By the line graph of a graph G we shall mean the graph L(G) whose points are the edges of G, with two points of L(G) adjacent whenever they are adjacent in G. A graph G is said to be a line graph if there exists a graph H such that G = L(H).
Sumner, David P. Minimal line graphs. Glasgow mathematical journal, Tome 17 (1976) no. 1, pp. 12-16. doi: 10.1017/S0017089500002652
@article{10_1017_S0017089500002652,
author = {Sumner, David P.},
title = {Minimal line graphs},
journal = {Glasgow mathematical journal},
pages = {12--16},
year = {1976},
volume = {17},
number = {1},
doi = {10.1017/S0017089500002652},
url = {http://geodesic.mathdoc.fr/articles/10.1017/S0017089500002652/}
}
[1] 1.Beineke, L. W., Characterizations of derived graphs, j. Comb. Theory 9 (1970), 129–135. Google Scholar | DOI
[2] 2.Harary, F., Graph Theory (Reading, Massachusetts: Addison-Wesley Publishing Company, 1969). Google Scholar | DOI
[3] 3.Krauz, J., Démonstration nouvelle d'un théoréme de Whitney sur les réseaux, Mat. Fiz. Lapok 50 (1943), 75–89. Google Scholar
[4] 4.van Rooij, A. and Wilf, H., The interchange graphs of a finite graph, Ada Math. Acad. Sci. Hungar. 16 (1965), 263–269. Google Scholar | DOI
Cité par Sources :