• Home
  • Search
  • TOTAL OFFENSIVE ALLIANCE OF TOTAL GRAPHS GENERATED FROM GRAPHS WITH MAXIMUM DEGREE 2
  • Cite Icon1
  • https://doi.org/10.17654/0974165825025Copy DOI Icon

TOTAL OFFENSIVE ALLIANCE OF TOTAL GRAPHS GENERATED FROM GRAPHS WITH MAXIMUM DEGREE 2

Show More
  • Abstract
  • Literature Map
  • Citations
  • Similar Papers
Abstract

For a nontrivial connected graph , a nonempty subset is a total offensive alliance in if is an offensive alliance and every vertex in has at least one neighbor within . The minimum cardinality of a total offensive alliance in is called the total offensive alliance number of , denoted by . In this paper, we investigate the total offensive alliance of total graphs generated from graphs with maximum degree 2 and present the characterization of total offensive alliance and their corresponding total offensive alliance number.

Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.