Sciweavers

829 search results - page 33 / 166
» Distance domination-critical graphs
Sort
View
DAM
2008
145views more  DAM 2008»
14 years 12 months ago
Unicyclic and bicyclic graphs having minimum degree distance
In this paper characterizations of connected unicyclic and bicyclic graphs in terms of the degree sequence, as well as the graphs in these classes minimal with respect to the degr...
Alexandru Ioan Tomescu
CPM
2008
Springer
149views Combinatorics» more  CPM 2008»
15 years 1 months ago
On Compact Representations of All-Pairs-Shortest-Path-Distance Matrices
Let G be an unweighted and undirected graph of n nodes, and let D be the n
Igor Nitto, Rossano Venturini
EJC
2006
14 years 12 months ago
On the canonical metric representation, average distance, and partial Hamming graphs
Average distance of a graph is expressed in terms of its canonical metric representation. The equality can be modified to an inequality in such a way that it characterizes isometr...
Sandi Klavzar
JCB
2006
124views more  JCB 2006»
14 years 11 months ago
The Distribution of Genomic Distance between Random Genomes
We study the probability distribution of genomic distance d under the hypothesis of random gene order. We translate the random order assumption into a stochastic method for constr...
David Sankoff, Lani Haque
JMLR
2006
97views more  JMLR 2006»
14 years 11 months ago
Distance Patterns in Structural Similarity
Similarity of edge labeled graphs is considered in the sense of minimum squared distance between corresponding values. Vertex correspondences are established by isomorphisms if bo...
Thomas Kämpke