Algebraic graph theory for ordering

DOI10.1016/0045-7949(90)90196-9zbMath0743.05040OpenAlexW2077242514MaRDI QIDQ4713689

Ali Kaveh

Publication date: 25 June 1992

Published in: Computers & Structures (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0045-7949(90)90196-9

zbMATH Keywords

transversalnodal numberingshortest route tree

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (1)

A new algorithm for finding a pseudoperipheral vertex or the endpoints of a pseudodiameter in a graph

This page was built for publication: Algebraic graph theory for ordering