Now showing items 1-7 of 7
Boolean distance for graphs
(Elsevier, 1982)
The boolean distance between two points x and y of a connected graph G is defined as the set of all points on all paths joining x and y in G (O if X = y). It is determined in terms of the block-cutpoint graph of G, and ...
Digital metrics: A graph-theoretical approach
(Elsevier, 1984-03)
Consider the following two graphs M and N, both with vertex set Z x Z, where Z is the set of all integers. In M, two vertices are adjacent when their euclidean distance is 1, while in N, adjacency is obtained when the ...
Embedding and characterization of quantum chemical reaction graphs on two-dimensional orientable surfaces
(Elsevier, 1988-03)
Quantum chemical reaction graphs defined on multidimensional potential energy hypersurfaces are embedded on two-dimensional orientable surfaces. Topological invariants of these graphs and those of the embedding two-dimensional ...
A simple algorithm to detect balance in signed graphs
(Elsevier, 1980-09)
We develop a natural correspondence between marked graphs and balanced signed graphs, and exploit it to obtain a simple linear time algorithm by which any signed graph may be tested for balance.
On signed digraphs with all cycles negative
(Elsevier, 1985-10)
It is known that signed graphs with all cycles negative are those in which each block is a negative cycle or a single line. We now study the more difficult problem for signed diagraphs. In particular we investigate the ...
The class reconstruction number of maximal planar graphs
(Springer-Verlag, 1987-12)
The reconstruction number rn(G) of a graph G was introduced by Harary and Plantholt as the smallest number of vertex-deleted subgraphs G i = G − v i in the deck of G which do not all appear in the deck of any other graph. ...