Domination in bipartite graphs and in their complements

Simple item page
dc.contributor.authorZelinka, Bohdan
dc.date.accessioned2015-10-26
dc.date.available2015-10-26
dc.date.issued2015
dc.date.issued2003
dc.description.abstractThe domatic numbers of a graph G and of its complement G were studied by J. E. Dunbar, T. W. Haynes and M. A. Henning. They suggested four open problems. We will solve the following ones: Characterize bipartite graphs G having d(G) = d(Ḡ). Further, we will present a partial solution to the problem: Is it true that if G is a graph satisfying d(G) = d(Ḡ), then γ(G) = γ(Ḡ)? Finally, we prove an existence theorem concerning the total domatic number of a graph and of its complement.en
dc.formattext
dc.formattext
dc.identifier.doi10.1016/j.physletb.2015.03.056
dc.identifier.doi10.1023/A:1026266816053
dc.identifier.issn0370-2693
dc.identifier.issn0011-4642
dc.identifier.scopus2-s2.0-84927722335
dc.identifier.scopus2-s2.0-0041738904
dc.identifier.urihttps://dspace.tul.cz/handle/15240/16326
dc.identifier.urihttps://dspace.tul.cz/handle/15240/13327
dc.language.isoen
dc.language.isoen
dc.publisherElsevier
dc.publisherTechnical university of Liberec, Czech Republicen
dc.publisherTechnická Univerzita v Libercics
dc.relation.ispartofCzechoslovak Mathematical Journalen
dc.sourcej-scopus
dc.sourcej-wok
dc.sourcej-scopus
dc.subjectbipartite graphen
dc.subjectcomplement of a graphen
dc.subjectdomatic numberen
dc.titleDomination in bipartite graphs and in their complementsen
dc.typeArticle
dc.typeArticle
local.accessοpen
local.citation.epage259
local.citation.epage247
local.citation.spage241
local.departmentDepartment of Physics
local.facultyFaculty of Sciences, Humanities and Education
local.identifier.codenPYLBA
local.identifier.wok353892000039
local.relation.issue2
local.relation.volume53
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
2-s2.0-0041738904.pdf
Size:
99.3 KB
Format:
Adobe Portable Document Format
Description:
Download
Collections