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

DOI10.26493/1855-3974.1460.fd6zbMath1416.05180OpenAlexW2899747194MaRDI QIDQ5225029

John Baptist Gauci, Irene Sciriha, Didar A. Ali, 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

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

• Unnamed Item
• On the number of P-vertices of some graphs
• On Fiedler- and Parter-vertices of acyclic matrices
• On the construction of graphs of nullity one
• Coalescing Fiedler and core vertices
• A characterization of singular graphs
• Coalesced and embedded nut graphs in singular graphs
• Maximal core size in singular graphs
• Spectra and structural polynomials of graphs of relevance to the theory of molecular conduction
• Interlacing–extremal graphs

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