The conductivity of superimposed key-graphs with a common one-dimensional adjacency nullspace

DOI10.26493/1855-3974.1460.FD6MaRDI QIDQ5225029zbMATH OpenOpenAlexFDO

Authors Irene Sciriha, Didar A. Ali, John Baptist Gauci, Khidir R. Sharaf

Publication date 25 July 2019

Published in Ars Mathematica Contemporanea (Search for Journal in Brave)

Full work available at URL https://doi.org/10.26493/1855-3974.1460.fd6

zbMATH Keywords

circuitcore verticeskey-graphsnullitysuperimposition

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Eigenvalues, singular values, and eigenvectors (15A18) Applications of operator theory in systems, signals, circuits, and control theory (47N70)

Recommendations

• Nullity of a graph with a cut-edge
• Interlacing-extremal graphs
• On the construction of graphs of nullity one
• Coalescing Fiedler and core vertices.
• Remarks on the nullity of graphs

Cites work

• A characterization of singular graphs
• Coalesced and embedded nut graphs in singular graphs
• Coalescing Fiedler and core vertices.
• scientific article; zbMATH DE number 3204642 (Why is no real title available?)
• Interlacing-extremal graphs
• Maximal core size in singular graphs
• On Fiedler- and Parter-vertices of acyclic matrices
• On the construction of graphs of nullity one
• On the number of P-vertices of some graphs
• Spectra and structural polynomials of graphs of relevance to the theory of molecular conduction

Cited in

(1)

• The fibre-sum of graphs

This page was built for publication: The conductivity of superimposed key-graphs with a common one-dimensional adjacency nullspace

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