Skip to content
Research Article Open access CC BY 4.0

Total Domination Number of Generalized Petersen Graphs P(ck,k)

Wensheng Li, Fengjun Liu, Liqiang Fan, Wei Chen, Jie Fang

Journal of Advances in Mathematics and Computer Science · pp. 1–7 · Published 31 Jul 2016

10.9734/BJMCS/2016/27588

Abstract

A set S of vertices of a graph G = (V, E) with no isolated vertex is a total dominating set if every vertex of V(G) is adjacent to some vertex in S. The total domination number is the minimum cardinality of a total dominating set of G. In this paper, we study the total domination in generalized Petersen graphs P(ck,k). The upper bounds of the total domination number of generalized Petersen graphs P(3k,k) and P(4k,k) are obtained.

Total domination number generalized Petersen graph upper bound.

Cited by 2

Matching Preclusion of the Generalized Petersen Graph

Ajay Arora, E. Cheng, Christopher Melekian · Theory and Applications of Graphs · 2019

Article metrics

Real usage data collected on this platform.

0

Page views

0

PDF downloads

0

Outbound clicks

2

Citations

Views by country

Approximate, from request IP at view time — not citizenship or institution. Countries with fewer than 5 views are grouped as "Other".

No views recorded yet.

Traffic sources

Referring site, by host.

No traffic recorded yet.

Views and downloads exclude known bots/crawlers. Citations combines this platform's own DOI-resolved index with each external source's own reported total — see Cited by above for individually listed citing works. Last refreshed 0 seconds ago.