Distance-related invariants on polygraphs

✍ Scribed by Martin Juvan; Bojan Mohar; Janez Žerovnik

• Book ID: 104294821
• Publisher: Elsevier Science
• Year: 1997
• Tongue: English
• Weight: 891 KB
• Volume: 80
• Category: Article
• ISSN: 0166-218X
• DOI: 10.1016/s0166-218x(97)00069-3

✦ Synopsis

Let M'"' be a graph which is obtained from a path R, or a cycle C,, by replacing each vertex by a fixed graph M and replacing each edge by a fixed set of edges joining the corresponding copies of M. A matrix approach to the computation of distance-related invariants in such graphs is presented. This approach gives a general procedure to obtain closed formulas (depending on M) for such invariants of M'"'. As an example, the Wiener index is treated in more detail.