Null decomposition of bipartite graphs without cycles of length 0 modulo 4

DOI10.1016/J.LAA.2020.03.030MaRDI QIDQ2229480zbMATH OpenOpenAlexFDO

Authors Gonzalo Molina, Adrián Pastine, Daniel A. Jaume

Publication date 17 February 2021

Published in Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.laa.2020.03.030

zbMATH Keywords

bipartite graphscyclesindependent setsmatching setsnull space

Mathematics Subject Classification ID

Trees (05C05) Distance in graphs (05C12) Paths and cycles (05C38) Graph representations (geometric and intersection representations, etc.) (05C62) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vector spaces, linear dependence, rank, lineability (15A03)

Recommendations

• Null decomposition of trees
• On the nullity of bipartite graphs
• Null decomposition of unicyclic graphs
• Bounds for the nullity of a graph in terms of the matching number and the independence number
• Nullities of cycle-spliced bipartite graphs

Cites work

• Graphs and matrices
• scientific article; zbMATH DE number 1460605 (Why is no real title available?)
• scientific article; zbMATH DE number 798644 (Why is no real title available?)
• scientific article; zbMATH DE number 1432797 (Why is no real title available?)
• scientific article; zbMATH DE number 3414355 (Why is no real title available?)
• Matching theory
• Null decomposition of trees
• Spektren endlicher Grafen
• The structure and maximum number of maximum independent sets in trees

Cited in

(1)

• On the core-nilpotent decomposition of unicyclic graphs

This page was built for publication: Null decomposition of bipartite graphs without cycles of length 0 modulo 4

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