On the Cube of a Graph

Jerome J. Karaganis

doi:10.4153/CMB-1968-037-0

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

The nth power Gn of a connected graph G is the graph with the same point set as G and where two points u and v are adjacent in Gn if and only if the distance between u and v in G is at most n. The graph G2 is called the square of G while G3 is referred to as the cube of G.

Crossref Citations

This article has been cited by the following publications. This list is generated based on data provided by Crossref.

Kronk, H. V. 1969. Is the Square of Every Nonseparable Graph Hamiltonian?. The American Mathematical Monthly, Vol. 76, Issue. 9, p. 1045.

Schaar, Günter 1971. Eine Eigenschaft der dritten Potenz brückenloser Graphen. Mathematische Nachrichten, Vol. 51, Issue. 1-6, p. 189.

Sekanina, Milan 1971. On an Algorithm for Ordering of Graphs. Canadian Mathematical Bulletin, Vol. 14, Issue. 2, p. 221.

Harary, Frank and Schwenk, Allen 1971. Trees with Hamiltonian square. Mathematika, Vol. 18, Issue. 1, p. 138.

Heinrich, Peter 1972. Verallgemeinerung eines Satzes von CHARTRAND und KAPOOR über Potenzen zusammenhängender Graphen. Mathematische Nachrichten, Vol. 54, Issue. 1-6, p. 85.

Lesniak, Linda 1973. Graphs with 1-Hamiltonian-connected cubes. Journal of Combinatorial Theory, Series B, Vol. 14, Issue. 2, p. 148.

1973. Graphs and Hypergraphs. Vol. 6, Issue. , p. 498.

Kozyrev, V. P. 1974. Graph theory. Journal of Soviet Mathematics, Vol. 2, Issue. 5, p. 489.

Schaar, Günter 1975. Eine Charakterisierung der Graphen, deren dritte Potenz 2‐hamiltonsch ist. Mathematische Nachrichten, Vol. 66, Issue. 1, p. 145.

Lesniak‐Foster, L. 1977. Some recent results in hamiltonian graphs. Journal of Graph Theory, Vol. 1, Issue. 1, p. 27.

Alpern, Steven 1978. Superhamiltonian graphs. Journal of Combinatorial Theory, Series B, Vol. 25, Issue. 1, p. 62.

Hobbs, Arthur M. 1978. Theory and Applications of Graphs. Vol. 642, Issue. , p. 271.

Faudree, R. J. and Schelp, R. H. 1978. Theory and Applications of Graphs. Vol. 642, Issue. , p. 160.

Molluzzo, John C. 1979. SOME HAMILTONIAN COUNTEREXAMPLES. Annals of the New York Academy of Sciences, Vol. 328, Issue. 1, p. 157.

Heinrich, Peter and Schaar, Günter 1979. Über zusammenhängende Graphen mit p‐hamiltonscher (p + 1)‐ter Potenz (p ≧ 4). Mathematische Nachrichten, Vol. 90, Issue. 1, p. 225.

Leighton, Frank Thomson and Leiserson, Charles E. 1982. Wafer-scale integration of systolic arrays. p. 297.

Leighton and Leiserson 1985. Wafer-Scale Integration of Systolic Arrays. IEEE Transactions on Computers, Vol. C-34, Issue. 5, p. 448.

Paoli, M. 1988. Hamiltonian properties of the cube of a 2‐edge connected graph. Journal of Graph Theory, Vol. 12, Issue. 1, p. 85.

Koh, K. M. and Teo, K. L. 1989. The 2‐hamiltonian cubes of graphs. Journal of Graph Theory, Vol. 13, Issue. 6, p. 737.

Hendry, G. R. T. 1990. Path extendable graphs. Periodica Mathematica Hungarica, Vol. 21, Issue. 3, p. 205.

Download full list

Article contents

On the Cube of a Graph

Extract

Save article to Kindle

Save article to Dropbox

Save article to Google Drive

Reply to: Submit a response

Your details

You have entered the maximum number of contributors

Conflicting interests