UNLEASHING THE VERMIN (VECTORED ROUTE-LENGTH MINIMIZATION)

DOI10.1142/S1793005708001148zbMath1178.05053arXiv0802.1912MaRDI QIDQ5506112

Florentin Smarandache, Sukanto Bhattacharya

Publication date: 28 January 2009

Published in: New Mathematics and Natural Computation (Search for Journal in Brave)

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

zbMATH Keywords

Euclidean spacegraph theorynetwork connectivity matrix

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10)

Cites Work

• A note on two problems in connexion with graphs
• About the cover: Euler and Königsberg's Bridges: A historical view
• Unnamed Item
• Unnamed Item

This page was built for publication: UNLEASHING THE VERMIN (VECTORED ROUTE-LENGTH MINIMIZATION)