The simplex geometry of graphs

DOI10.1093/comnet/cny036zbMath1472.05113arXiv1807.06475OpenAlexW2883500076WikidataQ128639701 ScholiaQ128639701MaRDI QIDQ4958765

Karel Devriendt, Piet Van Mieghem

Publication date: 15 September 2021

Published in: Journal of Complex Networks (Search for Journal in Brave)

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

zbMATH Keywords

Laplacian matrixgraph embeddingsimplex geometrygeometry of graphs

Mathematics Subject Classification ID

Polyhedra and polytopes; regular figures, division of spaces (51M20) Planar graphs; geometric and topological aspects of graph theory (05C10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Euclidean analytic geometry (51N20) Real and complex geometry (51M99) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (4)

Pattern Formation on Hypergraphs ⋮ Co-eigenvector graphs ⋮ Nonlinear network dynamics with consensus-dissensus bifurcation ⋮ Effective resistance is more than distance: Laplacians, simplices and the Schur complement

This page was built for publication: The simplex geometry of graphs