Complete graphs with zero diagonal inverse

DOI10.26493/1855-3974.639.249zbMATH Open1355.05120OpenAlexW2192659674WikidataQ129365972 ScholiaQ129365972MaRDI QIDQ2958693FDOQ2958693

Authors: Alexander Farrugia, John Baptist Gauci, Irene Sciriha 

Publication date: 3 February 2017

Published in: Ars Mathematica Contemporanea (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.26493/1855-3974.639.249

Recommendations

• On the inverse of the adjacency matrix of a graph
• On some graphs which possess inverses
• Inverting non-invertible labeled trees
• Inverses of weighted graphs
• On The Inverse Of A Class Of Bipartite Graphs With Unique Perfect Matchings

zbMATH Keywords

circulant matrixcomplete graphNSSDG-nutful graph

Mathematics Subject Classification ID

Applications of graph theory (05C90) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Signed and weighted graphs (05C22)

Cited In (3)

• Two-graphs and NSSDs: an algebraic approach
• On the inverse of the adjacency matrix of a graph
• Edge construction of molecular NSSDs

This page was built for publication: Complete graphs with zero diagonal inverse

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