A Note on Primitive Graphs
Canadian mathematical bulletin, Tome 15 (1972) no. 3, pp. 437-440
Voir la notice de l'article provenant de la source Cambridge University Press
Let G denote a connected graph with vertex set V(G) and edge set E(G). A subset C of E(G) is called a cutset of G if the graph with vertex set V(G) and edge set E(G)—C is not connected, and C is minimal with respect to this property. A cutset C of G is simple if no two edges of C have a common vertex. The graph G is called primitive if G has no simple cutset but every proper connected subgraph of G with at least one edge has a simple cutset. For any edge e of G, let G—e denote the graph with vertex set V(G) and with edge set E(G)—e.
Bouwer, I. Z.; LeBlanc, G. F. A Note on Primitive Graphs. Canadian mathematical bulletin, Tome 15 (1972) no. 3, pp. 437-440. doi: 10.4153/CMB-1972-079-2
@article{10_4153_CMB_1972_079_2,
author = {Bouwer, I. Z. and LeBlanc, G. F.},
title = {A {Note} on {Primitive} {Graphs}},
journal = {Canadian mathematical bulletin},
pages = {437--440},
year = {1972},
volume = {15},
number = {3},
doi = {10.4153/CMB-1972-079-2},
url = {http://geodesic.mathdoc.fr/articles/10.4153/CMB-1972-079-2/}
}
[1] 1. Graham, R. L., On primitive graphs and optimal vertex assignments, Proc. Internat. Conf. on Combinatorial Mathematics, New York, April 1970; New York Academy of Sciences, 1970. Google Scholar
[2] 2. Seshu, S. and Reed, M., Linear graphs and electrical networks, Addison-Wesley, Reading, Mass. 1961. Google Scholar
Cité par Sources :