Deletion of a vertex in even sum domination
Abstract: Some aspects of even sum domination are introduced generally in this book. Additionally, the number of even sum dominators in graph G may change or remain the same when a vertex is removed. The final step is to calculate the even sum domination number for every possible scenario in which a vertex in a connected network is removed.
- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
Online-Ressource
- Language
-
Englisch
- Bibliographic citation
-
Deletion of a vertex in even sum domination ; volume:14 ; number:1 ; year:2024 ; extent:4
Open engineering ; 14, Heft 1 (2024) (gesamt 4)
- Creator
-
Alfatlawi, Ahllam A.
Omran, Ahmed A.
- DOI
-
10.1515/eng-2022-0511
- URN
-
urn:nbn:de:101:1-2024030613505778245156
- Rights
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
14.08.2025, 11:00 AM CEST
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Alfatlawi, Ahllam A.
- Omran, Ahmed A.
Other Objects (12)
Vertex Deletion into Bipartite Permutation Graphs
Vertex Deletion Problems : A Parameterized Point of View
On Structural Parameterizations of the Bounded-Degree Vertex Deletion Problem
Preprocessing for Outerplanar Vertex Deletion: An Elementary Kernel of Quartic Size
Complexity of the (Connected) Cluster Vertex Deletion Problem on H-free Graphs
Total domination versus paired domination
Vertex
Even Factors in Edge-Chromatic-Critical Graphs with a Small Number of Divalent Vertices
From spin vertex to string vertex
Total Domination Versus Domination in Cubic Graphs
Sparse domination implies vector-valued sparse domination
La domination
Vertex Deletion into Bipartite Permutation Graphs
Vertex Deletion Problems : A Parameterized Point of View
On Structural Parameterizations of the Bounded-Degree Vertex Deletion Problem
Preprocessing for Outerplanar Vertex Deletion: An Elementary Kernel of Quartic Size
Complexity of the (Connected) Cluster Vertex Deletion Problem on H-free Graphs
Total domination versus paired domination
Vertex
Even Factors in Edge-Chromatic-Critical Graphs with a Small Number of Divalent Vertices
From spin vertex to string vertex
Total Domination Versus Domination in Cubic Graphs
Sparse domination implies vector-valued sparse domination
La domination
Vertex Deletion into Bipartite Permutation Graphs
Vertex Deletion Problems : A Parameterized Point of View
On Structural Parameterizations of the Bounded-Degree Vertex Deletion Problem
Preprocessing for Outerplanar Vertex Deletion: An Elementary Kernel of Quartic Size
Complexity of the (Connected) Cluster Vertex Deletion Problem on H-free Graphs
Total domination versus paired domination
Vertex
Even Factors in Edge-Chromatic-Critical Graphs with a Small Number of Divalent Vertices
From spin vertex to string vertex
Total Domination Versus Domination in Cubic Graphs
Sparse domination implies vector-valued sparse domination