| | SLO | ENG | Cookies and privacy

Bigger font | Smaller font

Show document Help

Title:Maximum independent sets in direct products of cycles or trees with arbitrary graphs
Authors:ID Paj Erker, Tjaša (Author)
ID Špacapan, Simon (Author)
Files:.pdf Discussiones_Mathematicae_Graph_Theory_2015_Paj,_Spacapan_Maximum_independent_sets_in_direct_products_of_cycles_or_trees_with_arbitrary.pdf (173,48 KB)
MD5: CB90C497C923333F607088283AF35010
 
URL http://www.discuss.wmie.uz.zgora.pl/gt/index.php?doi=10.7151/dmgt.1837
 
Language:English
Work type:Scientific work
Typology:1.01 - Original Scientific Article
Organization:FS - Faculty of Mechanical Engineering
Abstract:The direct product of graphs ▫$G = (V(G),E(G))$▫ and ▫$H = (V(H),E(H))$▫ is the graph, denoted as ▫$G \times H$▫, with vertex set ▫$V(G \times H) = V(G )\times V(H)$▫, where vertices ▫$(x_1,y_1)$▫ and ▫$(x_2,y_2)$▫ are adjacent in ▫$G \times H$▫ if ▫$x_1x_2 \in E(G)$▫ and ▫$y_1y_2 \in E(H)$▫. Let ▫$n$▫ be odd and ▫$m$▫ even. We prove that every maximum independent set in ▫$P_n \times G$▫, respectively ▫$C_m \times G$▫, is of the form ▫$(A \times C) \cup (B \times D)$▫, where ▫$C$▫ and ▫$D$▫ are nonadjacent in ▫$G$▫, and ▫$A \cup B$▫ is the bipartition of ▫$P_n$▫ respectively ▫$C_m$▫. We also give a characterization of maximum independent subsets of ▫$P_n \times G$▫ for every even ▫$n$▫ and discuss the structure of maximum independent sets in ▫$T \times G$▫ where ▫$T$▫ is a tree.
Keywords:direct product, independent set
Publication status:Published
Publication version:Version of Record
Year of publishing:2015
Number of pages:str. 675-688
Numbering:Letn. 35, št. 4
PID:20.500.12556/DKUM-65476 New window
ISSN:1234-3099
UDC:519.17
ISSN on article:1234-3099
COBISS.SI-ID:17610841 New window
NUK URN:URN:SI:UM:DK:Q8DUGYUA
Publication date in DKUM:07.04.2017
Views:1629
Downloads:555
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

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

Secondary language

Language:Slovenian
Title:Največje neodvisne množice v direktnih produktih ciklov in dreves s poljubnimi grafi
Abstract:Dokažemo, da je vsaka največja neodvisna množica v direktnem produktu sodega cikla ali lihe poti s poljubnim grafom $G$ unija množic $(A \times B$) in $(C \times D$), kjer sta $A$ in $C$ podmnožici cikla oziroma poti, ter $B$ in $D$ podmnožici grafa $G$. Prav tako diskutiramo strukturo največjih neodvisnih množic v direktnih produktih dreves s poljubnimi grafi.
Keywords:direktni produkt, neodvisna množica


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