Work

Total Offensive Alliance of Total Graphs Generated From Graphs With Maximum Degree 2

Year: 2025

Type: article

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.

Source: Advances and Applications in Discrete Mathematics

DOI: 10.17654/0974165825025

Authors: Maxene S. Hablo, Isagani S. Cabahug Jr.

Language: English

Topic: Advanced Graph Theory Research

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: hybrid

OpenAlex ID: W4408376104

FWCI: 0.496

Cites:

Cited by: 1

Related to: 10