On graphs with graphic imbalance sequences
The imbalance of the edge e = uv in a graph G is the value imbG(e) = |dG(u) − dG(v)|. We prove that the sequence MG of all edge imbalances in G is graphic for several classes of graphs including trees, graphs in which all non-leaf vertices form a clique and the so-called complete extensions of paths...
Gespeichert in:
| Datum: | 2014 |
|---|---|
| Hauptverfasser: | , |
| Format: | Artikel |
| Sprache: | English |
| Veröffentlicht: |
Інститут прикладної математики і механіки НАН України
2014
|
| Schriftenreihe: | Algebra and Discrete Mathematics |
| Online Zugang: | http://dspace.nbuv.gov.ua/handle/123456789/153349 |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Назва журналу: | Digital Library of Periodicals of National Academy of Sciences of Ukraine |
| Zitieren: | On graphs with graphic imbalance sequences / S. Kozerenko, V. Skochko // Algebra and Discrete Mathematics. — 2014. — Vol. 18, № 1. — С. 97–108. — Бібліогр.: 10 назв. — англ. |
Institution
Digital Library of Periodicals of National Academy of Sciences of Ukraine| Zusammenfassung: | The imbalance of the edge e = uv in a graph G is the value imbG(e) = |dG(u) − dG(v)|. We prove that the sequence MG of all edge imbalances in G is graphic for several classes of graphs including trees, graphs in which all non-leaf vertices form a clique and the so-called complete extensions of paths, cycles and complete graphs. Also, we formulate two interesting conjectures related to graphicality of MG. |
|---|