Let G = (V,E) be a simple graph. A subset X of E is called edge injective dominating set (edge Inj-dominating set) if for every edge f ∈ E - X there exists an edge g ∈ X such that |Γ(f,g)| ≥ 1, where |Γ(f,g)| is the number of common edge neighbors between the edges f and g. The minimum cardinality of such edge dominating set denoted by γ'in(G) and is called edge injective domination number (edge Inj-domination number) of G. In this paper, we introduce the edge injective domination number, injective independence edge number (Inj-independence edge number) β'in(G) and edge injective domatic number (edge Inj-domatic number) d'in(G) of a graph G. Exact values for some standard graphs, bounds and some interesting results are established.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.