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...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Information processing letters Jg. 178; S. 106297
1. Verfasser:	Sahbi, Rafik
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier B.V 01.11.2022
Schlagworte:	Algorithms Binary trees Defensive alliances Linear-time algorithms Matchings Matchings Algorithms Defensive alliances Linear-time algorithms Binary trees
ISSN:	0020-0190, 1872-6119
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!