The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

Displaying similar documents to “A lambda-graph system for the Dyck shift and its K -groups.”

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.

On The Determinant of q-Distance Matrix of a Graph

Hong-Hai Li, Li Su, Jing Zhang (2014)

Discussiones Mathematicae Graph Theory

Similarity:

In this note, we show how the determinant of the q-distance matrix Dq(T) of a weighted directed graph G can be expressed in terms of the corresponding determinants for the blocks of G, and thus generalize the results obtained by Graham et al. [R.L. Graham, A.J. Hoffman and H. Hosoya, On the distance matrix of a directed graph, J. Graph Theory 1 (1977) 85-88]. Further, by means of the result, we determine the determinant of the q-distance matrix of the graph obtained from a connected...