On graphs with graphic imbalance sequences
The imbalance of the edge e=uv in a graph \(G\) is the value \(imb_{G}(e)=|d_{G}(u)-d_{G}(v)|\). We prove that the sequence \(M_{G}\) 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 comple...
Saved in:
| Date: | 2018 |
|---|---|
| Main Authors: | , |
| Format: | Article |
| Language: | English |
| Published: |
Lugansk National Taras Shevchenko University
2018
|
| Subjects: | |
| Online Access: | https://admjournal.luguniv.edu.ua/index.php/adm/article/view/1049 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Journal Title: | Algebra and Discrete Mathematics |