Edge construction of molecular NSSDs

DOI10.1016/j.dam.2018.03.042zbMath1464.05338OpenAlexW2795476234WikidataQ130022307 ScholiaQ130022307MaRDI QIDQ2026330

Alexander Farrugia

Publication date: 19 May 2021

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2018.03.042

zbMATH Keywords

NSSDgraph inverseipso omni-insulatornonsingular treenuciferous graph

Mathematics Subject Classification ID

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

Related Items (2)

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the inverse of the adjacency matrix of a graph
• Complete graphs with zero diagonal inverse
• Nontrivial nuciferous graphs exist
• No chemical graph on more than two vertices is nuciferous
• On nonsingular trees and a reciprocal eigenvalue property
• On graphs with signed inverses
• On the inverse and the dual index of a tree
• Interlacing–extremal graphs
• Non-singular graphs with a singular deck

This page was built for publication: Edge construction of molecular NSSDs