A unique and novel graph matrix for efficient extraction of structural information of networks

DOI10.5614/ejgta.2021.9.1.4zbMath1468.05158arXiv1903.05341OpenAlexW3159540101MaRDI QIDQ4958043

Sivakumar Karunakaran, Lavanya Selvaganesh

Publication date: 6 September 2021

Published in: Electronic Journal of Graph Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1903.05341

zbMATH Keywords

strongly regular graphsmatrix productgraph propertiesgraph characterizationgraph matrices\(C_4\)-free

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Structural characterization of families of graphs (05C75) Distance in graphs (05C12) Graph representations (geometric and intersection representations, etc.) (05C62)

Cites Work

• Unnamed Item
• Unnamed Item
• Laplacian matrices of graphs: A survey
• Inverses of triangular matrices and bipartite graphs
• Combinatorial Matrix Theory and Generalized Inverses of Matrices
• On energy, Laplacian energy and p-fold graphs
• Reciprocal Complementary Distance Spectra and Reciprocal Complementary Distance Energy of Line Graphs of Regular Graphs
• Bounds for the Laplacian spectral radius of graphs
• On the spectrum of linear dependence graph of a finite dimensional vector space
• Squared distance matrix of a weighted tree
• Distance matrices and quadratic embedding of graphs
• On distance signless Laplacian spectrum and energy of graphs

This page was built for publication: A unique and novel graph matrix for efficient extraction of structural information of networks