| | SLO | ENG | Cookies and privacy

Bigger font | Smaller font

Show document Help

Title:Some results on total domination in direct products of graphs
Authors:ID Dorbec, Paul (Author)
ID Gravier, Sylvain (Author)
ID Klavžar, Sandi (Author)
ID Špacapan, Simon (Author)
Files:.pdf Discussiones_Mathematicae_Graph_Theory_2006_Dorbec_et_al._Some_results_on_total_domination_in_direct_products_of_graphs.pdf (156,67 KB)
MD5: 157809D73BCC2842FE12587990387352
 
URL http://www.discuss.wmie.uz.zgora.pl/gt/index.php?doi=10.7151/dmgt.1305
 
Language:English
Work type:Article
Typology:1.01 - Original Scientific Article
Organization:PEF - Faculty of Education
Abstract:Upper and lower bounds on the total domination number of the direct product ofgraphs are given. The bounds involve the ▫$\{2\}$▫-total domination number, the total 2-tuple domination number, and the open packing number of the factors. Using these relationships one exact total domination number is obtained. An infinite family of graphs is constructed showing that the bounds are best possible. The domination number of direct products of graphs is also bounded from below.
Keywords:mathematics, graph theory, direktni produkt, total domination, ▫$k$▫-tuple domination, open packing, domination
Publication status:Published
Publication version:Version of Record
Number of pages:str. 103-112
Numbering:Letn. 26, št. 1
PID:20.500.12556/DKUM-65353 New window
ISSN:1234-3099
UDC:519.17
ISSN on article:1234-3099
COBISS.SI-ID:13913689 New window
NUK URN:URN:SI:UM:DK:IB1W6FR2
Publication date in DKUM:31.03.2017
Views:1422
Downloads:525
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:Discussiones mathematicae. Graph theory
Shortened title:Discuss. Math., Graph Theory
Publisher:Technical University Press
ISSN:1234-3099
COBISS.SI-ID:7487065 New window

Document is financed by a project

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

Licences

License:CC BY-NC-ND 4.0, Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International
Link:http://creativecommons.org/licenses/by-nc-nd/4.0/
Description:The most restrictive Creative Commons license. This only allows people to download and share the work for no commercial gain and for no other purposes.
Licensing start date:31.03.2017

Secondary language

Language:Slovenian
Title:Nekaj rezultatov o celotni dominaciji direktnega produkta grafov
Abstract:Podane so zgornje in spodnje meje o celotnem dominacijskem številu direktnih produktov grafov. Meje vključujejo k-kratno dominacijsko število, 2-celotno dominacijsko število, celotno 2-kratno dominacijsko število in število odprtega pakiranja faktorjev. Z uporabo teh povezav je dobljeno en natančno celotno dominacijsko število. Konstruirana je neskončna družina grafov, ki pokaže, da so meje najboljšse možne. Podana je tudi spodnja meja za dominacijsko število direktnih produktov grafov.
Keywords:matematika, teorija grafov, celotna dominacija, ▫$k$▫-kratna dominacija, odprto pakiranje, 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