TY - JOUR
T1 - Degree Sequence of Tight Distance Graphs
AU - Matamala, M.
AU - Zamora, J.
N1 - Funding Information:
1 Partially supported by CONICYT doctoral grant, Proyecto Anillo de Redes ACT-08, FONDAP and BASAL-CMM projects 2 Email: [email protected] 3 Email: [email protected]
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
SN - 1571-0653
VL - 35
SP - 329
EP - 334
JO - Electronic Notes in Discrete Mathematics
JF - Electronic Notes in Discrete Mathematics
IS - C
ER -