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...
Saved in:
| Published in: | Algebra and Discrete Mathematics |
|---|---|
| Date: | 2014 |
| Main Authors: | , |
| Format: | Article |
| Language: | English |
| Published: |
Інститут прикладної математики і механіки НАН України
2014
|
| Online Access: | https://nasplib.isofts.kiev.ua/handle/123456789/153349 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Journal Title: | Digital Library of Periodicals of National Academy of Sciences of Ukraine |
| Cite this: | 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| _version_ | 1862539434718658560 |
|---|---|
| author | Kozerenko, S. Skochko, V. |
| author_facet | Kozerenko, S. Skochko, V. |
| citation_txt | On graphs with graphic imbalance sequences / S. Kozerenko, V. Skochko // Algebra and Discrete Mathematics. — 2014. — Vol. 18, № 1. — С. 97–108. — Бібліогр.: 10 назв. — англ. |
| collection | DSpace DC |
| container_title | Algebra and Discrete Mathematics |
| description | 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.
|
| first_indexed | 2025-11-24T15:18:01Z |
| format | Article |
| fulltext | |
| id | nasplib_isofts_kiev_ua-123456789-153349 |
| institution | Digital Library of Periodicals of National Academy of Sciences of Ukraine |
| issn | 1726-3255 |
| language | English |
| last_indexed | 2025-11-24T15:18:01Z |
| publishDate | 2014 |
| publisher | Інститут прикладної математики і механіки НАН України |
| record_format | dspace |
| spelling | Kozerenko, S. Skochko, V. 2019-06-14T03:26:47Z 2019-06-14T03:26:47Z 2014 On graphs with graphic imbalance sequences / S. Kozerenko, V. Skochko // Algebra and Discrete Mathematics. — 2014. — Vol. 18, № 1. — С. 97–108. — Бібліогр.: 10 назв. — англ. 1726-3255 2010 MSC:05C07, 05C99. https://nasplib.isofts.kiev.ua/handle/123456789/153349 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. en Інститут прикладної математики і механіки НАН України Algebra and Discrete Mathematics On graphs with graphic imbalance sequences Article published earlier |
| spellingShingle | On graphs with graphic imbalance sequences Kozerenko, S. Skochko, V. |
| title | On graphs with graphic imbalance sequences |
| title_full | On graphs with graphic imbalance sequences |
| title_fullStr | On graphs with graphic imbalance sequences |
| title_full_unstemmed | On graphs with graphic imbalance sequences |
| title_short | On graphs with graphic imbalance sequences |
| title_sort | on graphs with graphic imbalance sequences |
| url | https://nasplib.isofts.kiev.ua/handle/123456789/153349 |
| work_keys_str_mv | AT kozerenkos ongraphswithgraphicimbalancesequences AT skochkov ongraphswithgraphicimbalancesequences |