Please use this identifier to cite or link to this item: https://research.matf.bg.ac.rs/handle/123456789/682
Title: Weakly Convex and Convex Domination Numbers for Generalized Petersen and Flower Snark Graphs
Authors: KRATICA, JOZEF
MATIC, DRAGAN
Filipović, Vladimir 
Affiliations: Informatics and Computer Science 
Keywords: convex domination number;flower snark graphs;generalized Petersen graphs;graph domination;number;weakly convex domination
Issue Date: 1-Jan-2020
Journal: Revista de la Union Matematica Argentina
Abstract: 
We consider the weakly convex and convex domination numbers for two classes of graphs: generalized Petersen graphs and flower snark graphs. For a given generalized Petersen graph GP(n, k), we prove that if k = 1 and n < 4 then both the weakly convex domination number wcon(GP(n, k)) and the convex domination number con(GP(n, k)) are equal to n. For k < 2 and n < 13, wcon(GP(n, k)) = con(GP(n, k)) = 2n, which is the order of GP(n, k). Special cases for smaller graphs are solved by the exact method. For a flower snark graph Jn, where n is odd and n < 5, we prove that wcon(Jn) = 2n and con(Jn) = 4n.
URI: https://research.matf.bg.ac.rs/handle/123456789/682
ISSN: 00416932
DOI: 10.33044/REVUMA.V61N2A16
Appears in Collections:Research outputs

Show full item record

SCOPUSTM   
Citations

3
checked on Dec 18, 2024

Page view(s)

8
checked on Dec 23, 2024

Google ScholarTM

Check

Altmetric

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.