Triangles in inverse NSSD graphs

DOI10.1080/03081087.2017.1302405zbMath1429.05124OpenAlexW2595380841MaRDI QIDQ5206294

Alexander Farrugia, Irene Sciriha

Publication date: 18 December 2019

Published in: Linear and Multilinear Algebra (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/03081087.2017.1302405

zbMATH Keywords

NSSDvertex-deleted subgraphgraph inverseterminal vertex

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph minors (05C83) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10) Signed and weighted graphs (05C22)

Related Items (2)

A novel method to construct NSSD molecular graphs ⋮ The polynomial reconstruction problem: the first 50 years

Cites Work

• On the inverse of the adjacency matrix of a graph
• No chemical graph on more than two vertices is nuciferous
• Interlacing–extremal graphs
• Non-singular graphs with a singular deck

This page was built for publication: Triangles in inverse NSSD graphs