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

DOI10.26493/1855-3974.1460.FD6zbMATH Open1416.05180OpenAlexW2899747194MaRDI QIDQ5225029FDOQ5225029

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

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

zbMATH Keywords

circuitnullitysuperimpositioncore verticeskey-graphs

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• On Fiedler- and Parter-vertices of acyclic matrices
• A characterization of singular graphs
• On the number of P-vertices of some graphs
• On the construction of graphs of nullity one
• Maximal core size in singular graphs
• Interlacing-extremal graphs
• Coalesced and embedded nut graphs in singular graphs
• Coalescing Fiedler and core vertices.
• Spectra and structural polynomials of graphs of relevance to the theory of molecular conduction

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)