| | SLO | ENG | Cookies and privacy

Bigger font | Smaller font

Show document Help

Title:Roman domination number of the Cartesian products of paths and cycles
Authors:ID Repolusk, Polona (Author)
ID Žerovnik, Janez (Author)
Files:.pdf Electronic_Journal_of_Combinatorics_2012_Repolusk,_Zerovnik_Roman_domination_number_of_the_Cartesian_products_of_paths_and_cycles.pdf (719,06 KB)
MD5: 7B6681AABE2A4F6CEDF9F32D19F96E25
PID: 20.500.12556/dkum/937b65a6-8179-41f3-a998-533d6188b981
 
URL http://www.combinatorics.org/ojs/index.php/eljc/article/view/v19i3p19
 
Language:English
Work type:Scientific work
Typology:1.01 - Original Scientific Article
Organization:FNM - Faculty of Natural Sciences and Mathematics
Abstract:Roman domination is a historically inspired variety of general domination such that every vertex is labeled with labels from $\{0,1,2\}$. Roman domination number is the smallest of the sums of labels fulfilling condition that every vertex, labeled 0, has a neighbor, labeled 2. Using algebraic approach we give ▫$O(C)$▫ time algorithm for computing Roman domination number of special classes of polygraphs (rota- and fasciagraphs). By implementing the algorithm we give formulas for Roman domination number of the Cartesian products of paths and cycles ▫$P_n \Box P_k$▫, ▫$P_n \Box C_k$▫ for ▫$k \leq 8$▫ and ▫$n \in {\mathbb N}$▫ and for ▫$C_n \Box P_k$▫ and ▫$C_n \Box C_k$▫ for ▫$k \leq 5$▫, ▫$n \in {\mathbb N}$▫. We also give a list of Roman graphs among investigated families.
Keywords:graph theory, Roman domination number, Cartesian product, polygraphs, path algebra
Publication status:Published
Publication version:Version of Record
Submitted for review:16.01.2011
Article acceptance date:01.08.2012
Publication date:09.08.2012
Publisher: Electronic Journal of Combinatorics
Year of publishing:2012
Number of pages:str. 1-37
Numbering:Letn. 19, št. 3
PID:20.500.12556/DKUM-67551 New window
ISSN:1077-8926
UDC:519.17
ISSN on article:1077-8926
COBISS.SI-ID:16394585 New window
NUK URN:URN:SI:UM:DK:AX7NMELG
Publication date in DKUM:23.08.2017
Views:2005
Downloads:326
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:The Electronic journal of combinatorics
Shortened title:Electron. j. comb.
Publisher:N.J. Calkin and H.S. Wilf
ISSN:1077-8926
COBISS.SI-ID:6973785 New window

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:09.08.2012

Secondary language

Language:Slovenian
Title:Rimsko dominantno število kartezičnega produkta poti in ciklov
Abstract:Rimska dominacija je zgodovinsko utemeljena različica običajne dominacije, pri kateri vozlišča grafa označimo z oznakami iz množice ▫$\{0,1,2\}$▫ tako, da ima vsako vozlišče z oznako 0 soseda z oznako 2. Najmanjšo izmed vsot oznak grafa imenujemo rimsko dominantno število grafa. Z uporabo algebraičnega pristopa dobimo konstantni algoritem za računanje rimskega dominantnega števila posebne vrste poligrafov: rota- in fasciagrafov. V posebnih primerih izračunamo formule za rimsko dominanto število kartezičnega produkta poti in ciklov ▫$P_n \Box P_k$▫, ▫$P_n \Box C_k$▫ za ▫$k \leq 8$▫ in ▫$n \in {\mathbb N}$▫ ter za ▫$C_n \Box P_k$▫ in ▫$C_n \Box C_k$▫ za ▫$k \leq 5$▫, ▫$n \in {\mathbb N}$▫. Dodan je seznam rimskih grafov med kartezičnimi produkti zgoraj omenjenih poti in ciklov.
Keywords:teorija grafov, kartezični produkt, rimsko dominantno število, poligrafi, algebra poti


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