Diametral path graphs

J. S. Deogun, D. Kratsch

Research output: Chapter in Book/Report/Conference proceedingConference contribution

13 Citations (Scopus)

Abstract

We introduce a new class of graphs called diametral path graphs that properly contains the class of asteroidal triple-free graphs and the class of dominating pair graphs. We characterize the trees as well as the chordal graphs that are diametral path graphs. We present an O(n3 m) algorithm deciding whether a given graph has a dominating diametral path. Finally, we study the structure of minimum connected dominating sets in diametral path graphs.

Original languageEnglish (US)
Title of host publicationGraph-Theoretic Concepts in Computer Science - 21st International Workshop, WG 1995, Proceedings
EditorsManfred Nagl
PublisherSpringer Verlag
Pages344-357
Number of pages14
ISBN (Print)3540606181, 9783540606185
StatePublished - Jan 1 1995
Event21st International Workshop on Graph-Theoretic Concepts in Computer Science, WG 1995 - Aachen, Germany
Duration: Jun 20 1995Jun 22 1995

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1017
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other21st International Workshop on Graph-Theoretic Concepts in Computer Science, WG 1995
CountryGermany
CityAachen
Period6/20/956/22/95

Fingerprint

Path
Graph in graph theory
Connected Dominating Set
Chordal Graphs
Class

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Deogun, J. S., & Kratsch, D. (1995). Diametral path graphs. In M. Nagl (Ed.), Graph-Theoretic Concepts in Computer Science - 21st International Workshop, WG 1995, Proceedings (pp. 344-357). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1017). Springer Verlag.

Diametral path graphs. / Deogun, J. S.; Kratsch, D.

Graph-Theoretic Concepts in Computer Science - 21st International Workshop, WG 1995, Proceedings. ed. / Manfred Nagl. Springer Verlag, 1995. p. 344-357 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1017).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Deogun, JS & Kratsch, D 1995, Diametral path graphs. in M Nagl (ed.), Graph-Theoretic Concepts in Computer Science - 21st International Workshop, WG 1995, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1017, Springer Verlag, pp. 344-357, 21st International Workshop on Graph-Theoretic Concepts in Computer Science, WG 1995, Aachen, Germany, 6/20/95.
Deogun JS, Kratsch D. Diametral path graphs. In Nagl M, editor, Graph-Theoretic Concepts in Computer Science - 21st International Workshop, WG 1995, Proceedings. Springer Verlag. 1995. p. 344-357. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Deogun, J. S. ; Kratsch, D. / Diametral path graphs. Graph-Theoretic Concepts in Computer Science - 21st International Workshop, WG 1995, Proceedings. editor / Manfred Nagl. Springer Verlag, 1995. pp. 344-357 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{2a449d88641d42c0a881072f8a520f52,
title = "Diametral path graphs",
abstract = "We introduce a new class of graphs called diametral path graphs that properly contains the class of asteroidal triple-free graphs and the class of dominating pair graphs. We characterize the trees as well as the chordal graphs that are diametral path graphs. We present an O(n3 m) algorithm deciding whether a given graph has a dominating diametral path. Finally, we study the structure of minimum connected dominating sets in diametral path graphs.",
author = "Deogun, {J. S.} and D. Kratsch",
year = "1995",
month = "1",
day = "1",
language = "English (US)",
isbn = "3540606181",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "344--357",
editor = "Manfred Nagl",
booktitle = "Graph-Theoretic Concepts in Computer Science - 21st International Workshop, WG 1995, Proceedings",

}

TY - GEN

T1 - Diametral path graphs

AU - Deogun, J. S.

AU - Kratsch, D.

PY - 1995/1/1

Y1 - 1995/1/1

N2 - We introduce a new class of graphs called diametral path graphs that properly contains the class of asteroidal triple-free graphs and the class of dominating pair graphs. We characterize the trees as well as the chordal graphs that are diametral path graphs. We present an O(n3 m) algorithm deciding whether a given graph has a dominating diametral path. Finally, we study the structure of minimum connected dominating sets in diametral path graphs.

AB - We introduce a new class of graphs called diametral path graphs that properly contains the class of asteroidal triple-free graphs and the class of dominating pair graphs. We characterize the trees as well as the chordal graphs that are diametral path graphs. We present an O(n3 m) algorithm deciding whether a given graph has a dominating diametral path. Finally, we study the structure of minimum connected dominating sets in diametral path graphs.

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

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

M3 - Conference contribution

AN - SCOPUS:0346309252

SN - 3540606181

SN - 9783540606185

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 344

EP - 357

BT - Graph-Theoretic Concepts in Computer Science - 21st International Workshop, WG 1995, Proceedings

A2 - Nagl, Manfred

PB - Springer Verlag

ER -