2025-02-22T17:04:19-05:00 DEBUG: VuFindSearch\Backend\Solr\Connector: Query fl=%2A&wt=json&json.nl=arrarr&q=id%3A%22oai%3Aojs.admjournal.luguniv.edu.ua%3Aarticle-2368%22&qt=morelikethis&rows=5
2025-02-22T17:04:19-05:00 DEBUG: VuFindSearch\Backend\Solr\Connector: => GET http://localhost:8983/solr/biblio/select?fl=%2A&wt=json&json.nl=arrarr&q=id%3A%22oai%3Aojs.admjournal.luguniv.edu.ua%3Aarticle-2368%22&qt=morelikethis&rows=5
2025-02-22T17:04:19-05:00 DEBUG: VuFindSearch\Backend\Solr\Connector: <= 200 OK
2025-02-22T17:04:19-05:00 DEBUG: Deserialized SOLR response

Existence of Dynkin scanning trees for non-serial posets with positive Tits quadratic form

Let \(G\) be a finite undirected connected graph. The minimum number of edges that must be removed to make the graph acyclic is called the circuit rank of \(G\). If such edges are fixed, the graph that remains is called a spanning tree of \(G\). In this paper we study scanning trees of the Hasse dia...

Full description

Saved in:
Bibliographic Details
Main Authors: Bondarenko, Vitaliy M., Styopochkina, Maryna V.
Format: Article
Language:English
Published: Lugansk National Taras Shevchenko University 2025
Subjects:
Online Access:https://admjournal.luguniv.edu.ua/index.php/adm/article/view/2368
Tags: Add Tag
No Tags, Be the first to tag this record!