Algebraic connectivity of graphs
Miroslav Fiedler (1973)
Czechoslovak Mathematical Journal
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “On the energy and spectral properties of the he matrix of hexagonal systems”
Algebraic connectivity of graphs
Multipartite separability of Laplacian matrices of graphs.
Wu, Chai Wah (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Spectra and Graph Comparison
Charles Delorme (2011)
Publications de l'Institut Mathématique
Similarity:
Testing of convex polyhedron visibility by means of graphs
Jozef Zámožík, Viera Zat'ková (1980)
Aplikace matematiky
Similarity:
This paper follows the article by V. Medek which solves the problem of finding the boundary of a convex polyhedron in both parallel and central projections. The aim is to give a method which yields a simple algorithm for the automation of an arbitrary graphic projection of a convex polyhedron. Section 1 of this paper recalls some necessary concepts from the graph theory. In Section 2 graphs are applied to determine visibility of a convex polyhedron.