Algebraic connectivity of graphs
Miroslav Fiedler (1973)
Czechoslovak Mathematical Journal
Similarity:
Miroslav Fiedler (1973)
Czechoslovak Mathematical Journal
Similarity:
Wu, Chai Wah (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Charles Delorme (2011)
Publications de l'Institut Mathématique
Similarity:
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.