a–Domination of Cartesian Product of Path Semigraphs
Narmadha Murugesan, D. Narmatha
Abstract
Open-access reader
Narmadha Murugesan, D. Narmatha
Abstract
Open-access reader
Abstract In a scientific enquiry it is common to study the behaviour of combined systems after studying the systems individually. The graphical structures are combined in many ways. The Cartesian product is one of the way of combining graphs to get more general structures from the simple structures. In this paper, we study a–domination number of the Cartesian product of some simple path semigraphs.
OpenAlex reports 2 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Abstract In a scientific enquiry it is common to study the behaviour of combined systems after studying the systems individually. The graphical structures are combined in many ways. The Cartesian product is one of the way of combining graphs to get more general structures from the simple structures. In this paper, we study a–domination number of the Cartesian product of some simple path semigraphs.
Key concepts: Cartesian product, Cartesian coordinate system, Simple (philosophy), Product (mathematics), Path (computing), Computer science, Mathematics, Algebra over a field