Extends null decomposition from trees to unicyclic graphs to produce bases for null spaces and closed formulas for independence and matching numbers from the graph support.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
math.CO 2years
2019 2verdicts
UNVERDICTED 2representative citing papers
Closed formulas for the independence and matching numbers of unicyclic graphs are derived from the support of the null space of their pendant trees.
citing papers explorer
-
Null Decomposition of Unicyclic Graphs
Extends null decomposition from trees to unicyclic graphs to produce bases for null spaces and closed formulas for independence and matching numbers from the graph support.
-
Independence and Matching Numbers of Unicyclic Graphs From Null Space
Closed formulas for the independence and matching numbers of unicyclic graphs are derived from the support of the null space of their pendant trees.