New sharp lower bound for the quorum coloring number of trees

•The alliance partition number of a tree has a new sharp lower bound computable in linear time.•This new lower bound is better than all those that have been previously established.•There is a relationship between the order, the diameter, the vertices degree and the matching number of a subgraph of a...

Celý popis

Podrobná bibliografia

Vydané v:	Information processing letters Ročník 178; s. 106297
Hlavný autor:	Sahbi, Rafik
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 01.11.2022
Predmet:	Algorithms Binary trees Defensive alliances Linear-time algorithms Matchings Matchings Algorithms Defensive alliances Linear-time algorithms Binary trees
ISSN:	0020-0190, 1872-6119
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!