Triangles in inverse NSSD graphs

DOI10.1080/03081087.2017.1302405MaRDI QIDQ5206294zbMATH OpenOpenAlexFDO

Authors 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

graph inverseNSSDterminal vertexvertex-deleted subgraph

Mathematics Subject Classification ID

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

Recommendations

• Inverse problems of graph theory: graphs without triangles
• Inverses of triangular matrices and bipartite graphs
• scientific article; zbMATH DE number 1347014
• scientific article; zbMATH DE number 2109447
• On triangles in derangement graphs
• Directed triangles in directed graphs
• Directed triangles in directed graphs
• Triangle graphs
• scientific article; zbMATH DE number 1539553
• scientific article; zbMATH DE number 12944

Cites work

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

Cited in

(7)

• On the inverse of the adjacency matrix of a graph
• Two-graphs and NSSDs: an algebraic approach
• Edge construction of molecular NSSDs
• A novel method to construct NSSD molecular graphs
• The polynomial reconstruction problem: the first 50 years
• The adjacency matrices of complete and nutful graphs
• Non-singular graphs with a singular deck

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

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