Directed graphs and matrix equations
Juraj Bosák (1978)
Mathematica Slovaca
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.
Displaying similar documents to “On integer sequences associated with the cyclic and complete graphs.”
Directed graphs and matrix equations
Algebraic connectivity of graphs
Miroslav Fiedler (1973)
Czechoslovak Mathematical Journal
Similarity:
A lambda-graph system for the Dyck shift and its -groups.
Krieger, Wolfgang, Matsumoto, Kengo (2003)
Documenta Mathematica
Similarity:
Multipartite separability of Laplacian matrices of graphs.
Wu, Chai Wah (2009)
The Electronic Journal of Combinatorics [electronic only]
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.