منابع مشابه
A characterization of the interval distance monotone graphs
A simple connected graph G is said to be interval distance monotone if the interval I (u, v) between any pair of vertices u and v in G induces a distance monotone graph. Aïder and Aouchiche [Distance monotonicity and a new characterization of hypercubes, Discrete Math. 245 (2002) 55–62] proposed the following conjecture: a graph G is interval distance monotone if and only if each of its interva...
متن کاملOn the distance eigenvalues of Cayley graphs
In this paper, we determine the distance matrix and its characteristic polynomial of a Cayley graph over a group G in terms of irreducible representations of G. We give exact formulas for n-prisms, hexagonal torus network and cubic Cayley graphs over abelian groups. We construct an innite family of distance integral Cayley graphs. Also we prove that a nite abelian group G admits a connected...
متن کاملDistance-Preserving Subgraphs of Interval Graphs
We consider the problem of finding small distance-preserving subgraphs of undirected, unweighted interval graphs with k terminal vertices. We prove the following results. 1. Finding an optimal distance-preserving subgraph is NP-hard for general graphs. 2. Every interval graph admits a subgraph with O(k) branching vertices that approximates pairwise terminal distances up to an additive term of +...
متن کاملA Characterization of Graphs with Interval Squares
The competition graph of a symmetric digraph D with a loop at each vertex is the square of the underlying graph of D with loops removed. In the interest of eeciently assigning radio frequencies in a communication network, we would like to determine which graphs have interval squares. Necessary and suucient conditions on the graph G are given for G 2 to be interval for several large classes of g...
متن کاملA matrix characterization of interval and proper interval graphs
In this work a matrix representation that characterizes the interval and proper interval graphs is presented, which is useful for the efficient formulation and solution of optimization problems, such as the k-cluster problem. For the construction of this matrix representation every such graph is associated with a node versus node zero–one matrix. In contrast to representations used in most of t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2007
ISSN: 0012-365X
DOI: 10.1016/j.disc.2006.11.010