ViraScience.
Article

Different-Distance Sets in a Graph

Jason T. Hedetniemi, Stephen T. Hedetniemi, Renu C. Renu C. Laskar, Henry Martyn Mulder

Abstract

A set of vertices $S$ in a connected graph $G$ is a different-distance set if, for any vertex $w$ outside $S$, no two vertices in $S$ have the same distance to $w$. The lower and upper different-distance number of a graph are the order of a smallest, respectively largest, maximal different-distance set. We prove that a different-distance set induces either a special type of path or an independent set. We present properties of different-distance sets, and consider the different-istance numbers of paths, cycles, Cartesian products of bipartite graphs, and Cartesian products of complete graphs. We conclude with some open problems and questions.

Similar items

  • Circular Chromatic Numbers and Fractional Chromatic Numbers of Distance Graphs with Distance Sets Missing An Interval

    Scholarly record1998Ars Comb.Jianzhuan Wu, Wensong Lin

    Suppose S is a subset of a metric spaceM with a metric δ, and D a subset of positive real numbers. The distance graph G(S, D), with a distance set D, is the graph with vertex set S in which two vertices x and y are adjacent iff δ(x, y) ∈ D. Distance graphs, first studied by Eggle

  • Circular Chromatic Numbers of Distance Graphs with Distance Sets Missing Multiples

    Scholarly record2000Eur. J. Comb.Lingling Huang, Gerard J. Chang

    Given a set D of positive integers, the distance graph G(Z , D) has all integers as vertices, and two vertices are adjacent if and only if their difference is in D; that is, the vertex set is Z and the edge set is {uv : |u − v| ∈ D}. We call D the distance set. This paper studies

  • Geodetic and Steiner geodetic sets in 3-Steiner distance hereditary graphs

    Scholarly record2008Discrete MathematicsLinda Eroh, Ortrud R. Oellermann

    Let G be a connected graph and S ⊆ V (G). Then the Steiner distance of S, denoted by dG(S), is the smallest number of edges in a connected subgraph of G containing S. Such a subgraph is necessarily a tree called a Steiner tree for S. The Steiner interval for a set S of vertices i

  • Chromatic number of graphs with special distance sets, I

    Scholarly record2014V. Yegnanarayanan

    Given a subset D of positive integers, an integer distance graph is a graphG(Z, D) with the set Z of integers as vertex set and with an edge joining two vertices u and v if and only if |u−v| ∈ D. In this paper we consider the problem of determining the chromatic number of certain

  • On marker set distance cospectral graphs

    Scholarly record2017Medha Itagi Huilgol

    Let G = (V ,E) be a simple undirected connected graph and let M be a nonempty subset of vertices of G. Using the results we have derived in our previous paper on marker set distance matrix, we define two graphs G1 with a marker set M1 and G2 with a marker set M2 to be marker set

  • DSI: A Method for Indexing Large Graphs Using Distance Set

    Scholarly record2010WAIMYubo Kou, Yukun Li, Xiaofeng Meng

    Recent years we have witnessed a great increase in modeling data as large graphs in multiple domains, such as XML, the semantic web, social network. In these circumstances, researchers are interested in querying the large graph like that: Given a large graph G, and a query Q, we