Name
Abstract | ||
|---|---|---|
If G is a connected graph having no vertices of degree 2 and L(G) is its line graph, two results are proven: if there exist distinct edges e and f with L(G) − e ≅ L(G) − f then there is an automorphism of L(G) mapping e to f; if G − u ¦ G − v for any distinct vertices u, v, then L(G) − e ¦ L(G) − f for any distinct edges e, f. |
Year | DOI | Venue |
|---|---|---|
1985 | 10.1016/0095-8956(85)90090-5 | Journal of Combinatorial Theory, Series B |
Keywords | Field | DocType |
line graph | Discrete mathematics,Combinatorics,Line graph,Vertex (geometry),Bound graph,Automorphism,Connectivity,Mathematics | Journal |
Volume | Issue | ISSN |
38 | 1 | 0095-8956 |
Citations | PageRank | References |
0 | 0.34 | 1 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| David W. Bange | 1 | 6 | 2.49 |
| Anthony E. Barkauskas | 2 | 6 | 2.49 |
| Peter J. Slater | 3 | 593 | 132.02 |