✦ LIBER ✦

On the group of the composition of two graphs

✍ Scribed by Harary, Frank

Book ID: 121670023
Publisher: Duke University Press
Year: 1959
Tongue: English
Weight: 612 KB
Volume: 26
Category: Article
ISSN: 0012-7094
DOI: 10.1215/S0012-7094-59-02603-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Bandwidth of the composition of two grap

Bandwidth of the composition of two graphs

✍ Toru Kojima 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 165 KB

On bandwidth and edgesum for the composi

On bandwidth and edgesum for the composition of two graphs

✍ Jiuqiang Liu; Kenneth Williams 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 469 KB

The composition of two graphs G and H, written G[H], is the graph with vertex set V(G) x V(H) and with (u,, uI) adjacent to (ul, ul) if either u1 is adjacent to IQ in G or u1 = u2 and ul is adjacent to v2 in H. In this paper, we investigate the bandwidth problem for the composition of two graphs and

The composition of graphs

✍ Sabidussi, Gert 📂 Article 📅 1959 🏛 Duke University Press 🌐 English ⚖ 344 KB

On the groups of repeated graphs

✍ Frucht, Robert 📂 Article 📅 1949 🏛 American Mathematical Society 🌐 English ⚖ 244 KB

On the sandpile group of the graph

✍ Yaoping Hou; Tiangang Lei; Chingwah Woo 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 166 KB

On the Sandpile Group of Dual Graphs

✍ Robert Cori; Dominique Rossin 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 205 KB

The group of recurrent configurations in the sandpile model, introduced by Dhar [7], may be considered as a finite abelian group associated with any graph G; we call it the sandpile group of G. The aim of this paper is to prove that the sandpile group of planar graph is isomorphic to that of its dua