Null decomposition of unicyclic graphs

DOI10.1016/J.DAM.2020.06.025MaRDI QIDQ2197477zbMATH OpenOpenAlexFDO

Authors Luiz Emilio Allem, Gonzalo Molina, Maikon Machado Toledo, Vilmar Trevisan, Daniel A. Jaume

Publication date 31 August 2020

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1907.08618

zbMATH Keywords

unicyclic graphssupportnullitynull space

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Abstract: In this work we obtain basis for the null space of unicyclic graphs. We extend the null decomposition of trees from [11] for unicyclic graphs. As an application, we obtain closed formulas for the independence and matching numbers of unicyclic graphs just using the support of the graph.

Recommendations

• Independence and matching numbers of unicyclic graphs from null space
• On the nullity and the matching number of unicyclic graphs
• The nullity of unicyclic graphs
• On the nullity of unicyclic graphs
• On the null-spaces of acyclic and unicyclic singular graphs

Cites work

• scientific article; zbMATH DE number 3681933 (Why is no real title available?)
• scientific article; zbMATH DE number 3417498 (Why is no real title available?)
• A graph theory package for Maple
• A note on the independence number of triangle-free graphs
• A relation between the matching number and Laplacian spectrum of a graph
• Approximating the independence number via the -function
• Graph partitioning by eigenvectors
• Independence and matching numbers of unicyclic graphs from null space
• Null decomposition of trees
• Null space structure of tree-patterned matrices
• On algebraic connectivity of graphs with at most two points of articulation in each block
• On the independence number of random graphs
• On the nullity of graphs with pendant trees
• On the nullity of unicyclic graphs
• Paths, Trees, and Flowers
• The influence of Miroslav Fiedler on spectral graph theory

Cited in

(10)

• On arbitraly vertex decomposable unicyclic graphs with dominating cycle
• Combinatorial inversion in edge-weighted unicyclic graphs
• Null decomposition of bipartite graphs without cycles of length 0 modulo 4
• Independence and matching numbers of unicyclic graphs from null space
• On simply structured kernel bases of unicyclic graphs
• On the null space structure associated with trees and cycles
• On the null-spaces of bicyclic singular graphs
• On the null-spaces of acyclic and unicyclic singular graphs
• On the structure of the inverse of non-singular unicyclic graphs
• A note on the nullity of unicyclic signed graphs

Describes a project that uses

Uses Software

• GraphTheory

This page was built for publication: Null decomposition of unicyclic graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2197477)