Degree Sequence of Tight Distance Graphs

M. Matamala, J. Zamora

Resultado de la investigación: Article

Resumen

A graph G on n vertices is a tight distance graph if there exists a set D ⊆ {1, 2, ..., n - 1} such that V (G) = {0, 1, ..., n - 1} and i j ∈ E (G) if and only if | i - j | ∈ D. A characterization of the degree sequences of tight distance graphs is given. This characterization yields a fast method for recognizing and realizing degree sequences of tight distance graphs.

Idioma originalEnglish
Páginas (desde-hasta)329-334
Número de páginas6
PublicaciónElectronic Notes in Discrete Mathematics
Volumen35
N.ºC
DOI
EstadoPublished - 1 dic 2009

Huella dactilar

Distance Graph
Degree Sequence
If and only if
Graph in graph theory

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Applied Mathematics

Citar esto

@article{de778db3d8fa408691df89db7c7b7ca9,
title = "Degree Sequence of Tight Distance Graphs",
abstract = "A graph G on n vertices is a tight distance graph if there exists a set D ⊆ {1, 2, ..., n - 1} such that V (G) = {0, 1, ..., n - 1} and i j ∈ E (G) if and only if | i - j | ∈ D. A characterization of the degree sequences of tight distance graphs is given. This characterization yields a fast method for recognizing and realizing degree sequences of tight distance graphs.",
keywords = "degree sequence, distance graphs",
author = "M. Matamala and J. Zamora",
year = "2009",
month = "12",
day = "1",
doi = "10.1016/j.endm.2009.11.054",
language = "English",
volume = "35",
pages = "329--334",
journal = "Electronic Notes in Discrete Mathematics",
issn = "1571-0653",
publisher = "Elsevier",
number = "C",

}

Degree Sequence of Tight Distance Graphs. / Matamala, M.; Zamora, J.

En: Electronic Notes in Discrete Mathematics, Vol. 35, N.º C, 01.12.2009, p. 329-334.

Resultado de la investigación: Article

TY - JOUR

T1 - Degree Sequence of Tight Distance Graphs

AU - Matamala, M.

AU - Zamora, J.

PY - 2009/12/1

Y1 - 2009/12/1

N2 - A graph G on n vertices is a tight distance graph if there exists a set D ⊆ {1, 2, ..., n - 1} such that V (G) = {0, 1, ..., n - 1} and i j ∈ E (G) if and only if | i - j | ∈ D. A characterization of the degree sequences of tight distance graphs is given. This characterization yields a fast method for recognizing and realizing degree sequences of tight distance graphs.

AB - A graph G on n vertices is a tight distance graph if there exists a set D ⊆ {1, 2, ..., n - 1} such that V (G) = {0, 1, ..., n - 1} and i j ∈ E (G) if and only if | i - j | ∈ D. A characterization of the degree sequences of tight distance graphs is given. This characterization yields a fast method for recognizing and realizing degree sequences of tight distance graphs.

KW - degree sequence

KW - distance graphs

UR - http://www.scopus.com/inward/record.url?scp=70949089269&partnerID=8YFLogxK

U2 - 10.1016/j.endm.2009.11.054

DO - 10.1016/j.endm.2009.11.054

M3 - Article

AN - SCOPUS:70949089269

VL - 35

SP - 329

EP - 334

JO - Electronic Notes in Discrete Mathematics

JF - Electronic Notes in Discrete Mathematics

SN - 1571-0653

IS - C

ER -