Now showing items 21-25 of 25
MEDIEVAL DISTORTIONS: THE PROJECTIONS OF ANCIENT MAPS
(Blackwell Publishing Ltd, 1966-06)
. Estimates of the map projection employed for an ancient map is a prerequisite for a variety of other studies. The preliminary evaluation presented here has yielded empirical equations for the Hereford map and illustrated ...
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.
A graph theoretic approach to matrix inversion by partitioning
(Springer-Verlag, 1962-12)
Let M be a square matrix whose entries are in some field. Our object is to find a permutation matrix P such that PM P −1 is completely reduced, i.e., is partitioned in block triangular form, so that all submatrices below ...
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. ...