| | SLO | ENG | Cookies and privacy

Bigger font | Smaller font

Show document Help

Title:Partitioning the vertex set of ▫$G$▫ to make ▫$G \Box H$▫ an efficient open domination graph
Authors:ID Kraner Šumenjak, Tadeja (Author)
ID Peterin, Iztok (Author)
ID Rall, Douglas F. (Author)
ID Tepeh, Aleksandra (Author)
Files:.pdf Discrete_Mathematics_&_Theoretical_Computer_Science_2016_Kraner_Sumenjak_et_al._Partitioning_the_vertex_set_of_G_to_make_GBoxH_an_effici.pdf (166,60 KB)
MD5: 20EB038F9F8D9EBB93887CF7B8EC698F
PID: 20.500.12556/dkum/ef6db32f-efb1-4e21-b2c1-74faf2d1a55f
 
URL http://dmtcs.episciences.org/1503
 
Language:English
Work type:Scientific work
Typology:1.01 - Original Scientific Article
Organization:FKBV - Faculty of Agriculture and Life Sciences
Abstract:A graph is an efficient open domination graph if there exists a subset of vertices whose open neighborhoods partition its vertex set. We characterize those graphs ▫$G$▫ for which the Cartesian product ▫$G \Box H$▫ is an efficient open domination graph when ▫$H$▫ is a complete graph of order at least 3 or a complete bipartite graph. The characterization is based on the existence of a certain type of weak partition of ▫$V(G)$▫. For the class of trees when ▫$H$▫ is complete of order at least 3, the characterization is constructive. In addition, a special type of efficient open domination graph is characterized among Cartesian products ▫$G \Box H$▫ when ▫$H$▫ is a 5-cycle or a 4-cycle.
Keywords:efficient open domination, Cartesian product, vertex labeling, total domination
Publication status:Published
Publication version:Version of Record
Year of publishing:2016
Number of pages:str. 1-15
Numbering:Letn. 18, št. 3
PID:20.500.12556/DKUM-66784 New window
ISSN:1365-8050
UDC:519.17:004
ISSN on article:1365-8050
COBISS.SI-ID:17696601 New window
NUK URN:URN:SI:UM:DK:KGS5WHX1
Publication date in DKUM:10.07.2017
Views:1228
Downloads:186
Metadata:XML DC-XML DC-RDF
Categories:Misc.
:
Copy citation
  
Average score:(0 votes)
Your score:Voting is allowed only for logged in users.
Share:Bookmark and Share



Hover the mouse pointer over a document title to show the abstract or click on the title to get all document metadata.

Record is a part of a journal

Title:Discrete mathematics & theoretical computer science
Shortened title:Discret. math. theor. comput. sci.
Publisher:DMTCS
ISSN:1365-8050
COBISS.SI-ID:8089433 New window

Document is financed by a project

Funder:ARRS - Slovenian Research Agency
Project number:P1-0297
Name:Teorija grafov

Licences

License:CC BY 4.0, Creative Commons Attribution 4.0 International
Link:http://creativecommons.org/licenses/by/4.0/
Description:This is the standard Creative Commons license that gives others maximum freedom to do what they want with the work as long as they credit the author.
Licensing start date:10.07.2017

Secondary language

Language:Slovenian
Title:Particije grafa ▫$G$▫, ki zagotavljajo učinkovito odprto dominiranost grafa ▫$G \Box H$▫
Abstract:Graf imenujemo učinkovito odprto dominiran, če zanj obstaja podmnožica vozlišč, katerih odprte okolice porajajo particijo množice vseh vozlišč. Karakteriziramo take grafe ▫$G$▫, da je kartezični produkt ▫$G \Box H$▫ učinkovito odprto dominiran v primerih, ko je ▫$H$▫ poln graf na vsaj treh vozliščih ali poln dvodelni graf. V obeh primerih karakterizacija temelji na obstoju določenega tipa šibke particije množice ▫$V(G)$▫. Za drevesa je, ko je ▫$H$▫ poln graf na vsaj treh vozliščih, karakterizacija konstrukcijska. Prav tako med kartezičnimi produkti ▫$G \Box H$▫ karakteriziramo posebne tipe učinkovito odprto dominiranih grafov, ko je $H$ 5-cikel ali 4-cikel.
Keywords:učinkovita odprta dominacija, kartezični produkt, označevanje vozlišč, totalna dominacija


Comments

Leave comment

You must log in to leave a comment.

Comments (0)
0 - 0 / 0
 
There are no comments!

Back
Logos of partners University of Maribor University of Ljubljana University of Primorska University of Nova Gorica