2025-02-23T05:55:39-05:00 DEBUG: VuFindSearch\Backend\Solr\Connector: Query fl=%2A&wt=json&json.nl=arrarr&q=id%3A%22irk-123456789-153349%22&qt=morelikethis&rows=5
2025-02-23T05:55:39-05:00 DEBUG: VuFindSearch\Backend\Solr\Connector: => GET http://localhost:8983/solr/biblio/select?fl=%2A&wt=json&json.nl=arrarr&q=id%3A%22irk-123456789-153349%22&qt=morelikethis&rows=5
2025-02-23T05:55:39-05:00 DEBUG: VuFindSearch\Backend\Solr\Connector: <= 200 OK
2025-02-23T05:55:39-05:00 DEBUG: Deserialized SOLR response
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:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Інститут прикладної математики і механіки НАН України
2014
|
| Series: | Algebra and Discrete Mathematics |
| Online Access: | http://dspace.nbuv.gov.ua/handle/123456789/153349 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!