Strong incidence domination index in fuzzy incidence graphs
Citation
R. Nair, K. & M.S., S. (2025). Strong incidence domination index in fuzzy incidence graphs. TWMS Journal of Applied and Engineering Mathematics, 15(9), 2297-2312.Abstract
This article introduces the concept of the domination index in fuzzy incidence graphs (FIGs) through the use of strong incidence domination. It explores several related notions, including fuzzy incidence irredundant set, fuzzy incidence independent set, fuzzy incidence independent dominating set, upper strong incidence domination number, strong incidence irredundance number, strong incidence upper irredundance number, strong incidence independent domination number and strong incidence independence number. The article examines inequalities involving these terms and introduces the concept of the strong incidence domination degree. It defines the strong incidence domination index in FIGs based on the domination degree of vertices and discusses bounds for the index. The study extends to complete FIGs, complete bipartite FIGs, fuzzy incidence cycles (FICs), fuzzy incidence trees (FITs), and the union and join of FIGs.
Volume
15Issue
9URI
https://jaem.isikun.edu.tr/web/index.php/current/135-vol15no9/1491https://belgelik.isikun.edu.tr/xmlui/handle/iubelgelik/7020
Collections
The following license files are associated with this item:
Related items
Showing items related by title, author, creator and subject.
-
Edge incident 2-edge coloring sum of graphs
Joseph, Anu; Dominic, Charles (Işık University Press, 2025-01)The edge incident 2-edge coloring number, ψ′ein2(G), of a graph G is the highest coloring number used in an edge coloring of a graph G such that the edges incident to an edge e = uv in G is colored with at most two distinct ... -
Chromatic weak domatic partition in graphs
Aristotle, Panneerselvam; Balamurugan, Solayappan; Selva Lakshmi, P.; Swaminathan, Venkatasubramanian (Işık University Press, 2019)In a simple graph G, a subset D of V (G) is called a chromatic weak dominating set if D is a weak dominating set and χ(< D >) = χ(G). Similar to domatic partition, chromatic weak domatic partition can be defined. The maximum ... -
Edge H-domination in graph
Kakrecha, Bhavesh (Işık University Press, 2021)This paper is about edge H-domination of the graph. The edge H-dominating set is defined and the characterization of a minimal edge H-dominating set of the graph with minimum degree 2 is given. The upper bound on the edge ...