Artykuł  

On the diameter of dot-critical graphs

Krótki opis
creativeworkseries.issn1232-9274
dc.contributor.authorMojdeh, Doost Ali
dc.contributor.authorMirzamani, Somayeh
dc.date.issued2009
dc.description.abstractA graph G is k-dot-critical (totaly k-dot-critical) if G is dot-critical (totaly dot-critical) and the domination number is k. In the paper [T. Burtona, D. P. Sumner, Domination dot-critical graphs, Discrete Math, 306(2006), 11–18] the following question is posed: What are the best bounds for the diameter of a k-dot-critical graph and a totally k-dot-critical graph G with no critical vertices for k ≥ 4? We find the best bound for the diameter of a k-dot-critical graph, where k ∈ {4, 5, 6} and we give a family of k-dot-critical graphs (with no critical vertices) with sharp diameter 2k − 3 for even k ≥ 4.en
dc.description.versionwersja wydawnicza
dc.identifier.eissn2300-6919
dc.identifier.issn1232-9274
dc.identifier.nukatdd2010315036
dc.identifier.urihttps://repo.agh.edu.pl/handle/AGH/50116
dc.language.isoeng
dc.rightsAttribution 4.0 International
dc.rights.accessotwarty dostęp
dc.rights.urihttps://creativecommons.org/licenses/by/4.0/legalcode
dc.subjectdot-critical graphen
dc.subjectdominationen
dc.subjectdiameteren
dc.titleOn the diameter of dot-critical graphsen
dc.title.relatedOpuscula Mathematica
dc.typeartykuł
dspace.entity.typePublication
publicationissue.issueNumberNo. 2
publicationissue.paginationpp. 165-175
publicationvolume.volumeNumberVol. 29
relation.isJournalIssueOfPublicationbb442f59-8ba3-474d-a7c6-9ba3168ac33f
relation.isJournalIssueOfPublication.latestForDiscoverybb442f59-8ba3-474d-a7c6-9ba3168ac33f
relation.isJournalOfPublication304b3b9b-59b9-4830-9178-93a77e6afbc7
Pliki
Pakiet podstawowy
Teraz pokazywane1 - 1 z 1
Miniatura
Nazwa:
29-2-06.pdf
Rozmiar:
231.58 KB
Format:
Adobe Portable Document Format
Opis:
Artykuł z czasopisma
Pobierz
Kolekcje
Artykuły (CN-OpMath)