The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

Displaying similar documents to “Radius-invariant graphs”

Diameter-invariant graphs

Ondrej Vacek (2005)

Mathematica Bohemica

Similarity:

The diameter of a graph G is the maximal distance between two vertices of  G . A graph G is said to be diameter-edge-invariant, if d ( G - e ) = d ( G ) for all its edges, diameter-vertex-invariant, if d ( G - v ) = d ( G ) for all its vertices and diameter-adding-invariant if d ( G + e ) = d ( e ) for all edges of the complement of the edge set of G . This paper describes some properties of such graphs and gives several existence results and bounds for parameters of diameter-invariant graphs.

Radio number for some thorn graphs

Ruxandra Marinescu-Ghemeci (2010)

Discussiones Mathematicae Graph Theory

Similarity:

For a graph G and any two vertices u and v in G, let d(u,v) denote the distance between u and v and let diam(G) be the diameter of G. A multilevel distance labeling (or radio labeling) for G is a function f that assigns to each vertex of G a positive integer such that for any two distinct vertices u and v, d(u,v) + |f(u) - f(v)| ≥ diam(G) + 1. The largest integer in the range of f is called the span of f and is denoted span(f). The radio number of G, denoted rn(G), is the minimum span...

One-two descriptor of graphs

K. CH. Das, I. Gutman, D. Vukičević (2011)

Bulletin, Classe des Sciences Mathématiques et Naturelles, Sciences mathématiques

Similarity: