Partial domination in prisms of graphs

Title

Partial domination in prisms of graphs

Creator

Nithya L.P.; Kureethara J.V.

Description

For any graph G = (V,E) and proportion p ? (0,1], a set S ? V is a p-dominating set if |N|V[S|]| ? p. The p-domination number ?p(G) equals the minimum cardinality of a p-dominating set in G. For a permutation ? of the vertex set of G, the graph ?G is obtained from two disjoint copies G1 and G2 of G by joining each v in G1 to ?(v) in G2. i.e., V (?G) = V (G1) ? V (G2) and E(G) = E(G1) ? E(G2) ? {(v, ?(v)): v ? V (G1), ?(v) ? V (G2)}. The graph ?G is called the prism of G with respect to ?. In this paper, we find some relations between the domination and the p-domination numbers in the context of graph and its prism graph for particular values of p. 2022 Forum-Editrice Universitaria Udinese SRL. All rights reserved.

Source

Italian Journal of Pure and Applied Mathematics, Vol-48, pp. 855-862.

Date

2022-01-01

Publisher

Forum-Editrice Universitaria Udinese SRL

Subject

algebraic graph theory; permutation graph; prism graph

Coverage

Nithya L.P., Department of Mathematics, Christ University, Bengaluru, India; Kureethara J.V., Department of Mathematics, Christ University, Bengaluru, India

Rights

Restricted Access

Relation

ISSN: 11268042

Format

Online

Language

English

Type

Article

Identifier

https://www.scopus.com/inward/record.uri?eid=2-s2.0-85144817026&partnerID=40&md5=816ccbdaf4e1073a706bf3265ba7344c