z-logo
open-access-imgOpen Access
Inverse Co-even Domination of Graphs
Author(s) -
Ahmed A. Omran,
Manar M. Shalaan
Publication year - 2020
Publication title -
iop conference series. materials science and engineering
Language(s) - English
Resource type - Journals
eISSN - 1757-899X
pISSN - 1757-8981
DOI - 10.1088/1757-899x/928/4/042025
Subject(s) - inverse , complement (music) , bipartite graph , mathematics , combinatorics , path (computing) , star (game theory) , discrete mathematics , computer science , graph , geometry , mathematical analysis , chemistry , biochemistry , complementation , programming language , gene , phenotype
The purpose of this paper is to introduce a new inverse domination parameter in the graphs it is called inverse co-even domination number. Some properties of the theory to this definition were only touched. Also, many properties and limitations on this definition are determined. Additionally, some properties of inverse co-even domination number for some certain graphs and its complement are founded, such as regular, complete, path, cycle, wheel, complete bipartite, and star.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here