Some Variations of Domination in Order Sum Graphs

Title

Some Variations of Domination in Order Sum Graphs

Creator

Amreen J.; Naduvath S.

Description

An order sum graph of a group G, denoted by ? os(G), is a graph with vertex set consisting of elements of G and two vertices say a, b? ? os(G) are adjacent if o(a) + o(b) > o(G). In this paper, we extend the study of order sum graphs of groups to domination. We determine different types of domination such as connected, global, strong, secure, restrained domination and so on for order sum graphs, their complement and line graphs of order sum graphs. 2022, The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

Source

Lecture Notes in Networks and Systems, Vol-462, pp. 117-125.

Date

2022-01-01

Publisher

Springer Science and Business Media Deutschland GmbH

Subject

Complement of a graph; Domination; Line graphs; Order sum graphs

Coverage

Amreen J., Department of Mathematics, CHRIST (Deemed to be University), Bangalore, India; Naduvath S., Department of Mathematics, CHRIST (Deemed to be University), Bangalore, India

Rights

Restricted Access

Relation

ISSN: 23673370; ISBN: 978-981192210-7

Format

Online

Language

English

Type

Conference paper

Identifier

https://doi.org/10.1007/978-981-19-2211-4_10

https://www.scopus.com/inward/record.uri?eid=2-s2.0-85135056427&doi=10.1007%2f978-981-19-2211-4_10&partnerID=40&md5=75b8367c1e88b20c2b7fb0d07c572717