Independence and matching numbers of unicyclic graphs from null space

We characterize unicyclic graphs that are singular using the support of the null space of their pendant trees. From this, we obtain closed formulas for the independence and matching numbers of a unicyclic graph, based on the support of its subtrees. These formulas allows one to compute independence...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Computational & applied mathematics 2020-05, Vol.39 (2), Article 64
Hauptverfasser:	Allem, L. Emilio, Jaume, Daniel A., Molina, Gonzalo, Toledo, Maikon M., Trevisan, Vilmar
Format:	Artikel
Sprache:	eng
Schlagworte:	Applications of Mathematics Applied physics Computational mathematics Computational Mathematics and Numerical Analysis Graph matching Graphs Linear algebra Mathematical Applications in Computer Science Mathematical Applications in the Physical Sciences Mathematics Mathematics and Statistics Mathematics, Applied Physical Sciences Science & Technology
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	We characterize unicyclic graphs that are singular using the support of the null space of their pendant trees. From this, we obtain closed formulas for the independence and matching numbers of a unicyclic graph, based on the support of its subtrees. These formulas allows one to compute independence and matching numbers of unicyclic graphs using linear algebra methods.
ISSN:	2238-3603 1807-0302
DOI:	10.1007/s40314-020-1090-3