Fully indecomposable and nearly decomposable graphs

MaRDI QIDQ5269931zbMATH OpenFDO

Authors S. Akbari, M. Ariannejad, Z. Tajfirouz, M. Aghabali

Publication date 28 June 2017

zbMATH Keywords

permanentfactorfully indecomposable graphpartly decomposable graph

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Determinants, permanents, traces, other special matrix functions (15A15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Degree of indecomposability of certain highly regular zero-one matrices
• Fully indecomposable and nearly decomposable matrices in Ω(r,s)
• Graph characterization of fully indecomposable nonconvertible \((0, 1)\)-matrices with minimal number of ones
• Nearly symmetric-indecomposable matrices
• \(r\)-indecomposable and \(r\)-nearly decomposable matrices

Cited in

(4)

• Nearly symmetric-indecomposable matrices
• Critically indecomposable graphs
• Necessary and Sufficient Conditions for the Existence of Local Matrix Decompositions
• Indecomposable Laplacian integral graphs

This page was built for publication: Fully indecomposable and nearly decomposable graphs

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