Search engine for discovering works of Art, research articles, and books related to Art and Culture
Javascript must be enabled to continue!
The Regular Pendant Domination Number of Some Special Graphs
View through CrossRef
This article aims to explore the concept of regular pendant domination across various distinct graph types, including complete graphs, path graphs, cycle graphs, lollipop graphs, barbell graphs, bistar graphs, Petersen graphs, fan graphs, cone graphs, helm graphs, windmill graphs and complete bipartite graphs. Additionally, we examine regular domination in relation to specific graph operations, such as the join and the corona product of two graphs.
Sociedade Paranaense de Matemática
Title: The Regular Pendant Domination Number of Some Special Graphs
Description:
This article aims to explore the concept of regular pendant domination across various distinct graph types, including complete graphs, path graphs, cycle graphs, lollipop graphs, barbell graphs, bistar graphs, Petersen graphs, fan graphs, cone graphs, helm graphs, windmill graphs and complete bipartite graphs.
Additionally, we examine regular domination in relation to specific graph operations, such as the join and the corona product of two graphs.
Related Results
Domination of Polynomial with Application
Domination of Polynomial with Application
In this paper, .We .initiate the study of domination. polynomial , consider G=(V,E) be a simple, finite, and directed graph without. isolated. vertex .We present a study of the Ira...
Graphs with at most two moplexes
Graphs with at most two moplexes
AbstractA moplex is a natural graph structure that arises when lifting Dirac's classical theorem from chordal graphs to general graphs. The notion is known to be closely related to...
Minimum Domination Energy of Some Derived Graphs
Minimum Domination Energy of Some Derived Graphs
In this study, we introduce and systematically explore the concept of minimum domination energy of derived graphs, representing a novel integration of two fundamental areas in grap...
Failed Independent Number in Neutrosophic Graphs
Failed Independent Number in Neutrosophic Graphs
New setting is introduced to study neutrosophic failed-independent number and failed independent neutrosophic-number arising neighborhood of different vertices. Neighbor is a key t...
Independent Set in Neutrosophic Graphs
Independent Set in Neutrosophic Graphs
New setting is introduced to study neutrosophic independent number and independent neutrosophic-number arising neighborhood of different vertices. Neighbor is a key term to have th...
On the total and conformable colorings of line regular graphs
On the total and conformable colorings of line regular graphs
A conformable coloring of a $k$-regular graph $G=(V,E)$ is a $(k+1)$-vertex coloring in which every color class (including empty ones) has cardinality the same parity as $|V|$; su...
Completion and decomposition of hypergraphs by domination hypergraphs
Completion and decomposition of hypergraphs by domination hypergraphs
A graph consists of a finite non-empty set of vertices and a set of unordered pairs of vertices, called edges. A dominating set of a graph is a set of vertices D such that every ve...
Independent and total domination in antiprism graphs from convex polytopes
Independent and total domination in antiprism graphs from convex polytopes
Let [Formula: see text] be a connected graph. Antiprism graphs, defined as the skeletons of antiprism-shaped convex polytopes, consist of [Formula: see text] vertices and [Formula:...