Fuzzy Dominator Coloring
Finding the right color for a graph while taking into account that each vertex in the graph dominates a whole color class is known as the dominator coloring problem. Fuzzy dominator coloring of certain regular graphs has been discussed here. Fuzzy dominator color and clique number of complete graphs, path graphs, and wheel graphs are related.
Authors
- K Sreeja
Publication Details
- Journal
- Journal of Information Systems Engineering & Management
- Published
- 2025-05-10
- DOI
- https://doi.org/10.52783/jisem.v10i44s.8880
- Primary Topic
- Graph Labeling and Dimension Problems
- Type
- article
- Field-Weighted Citation Impact
- 0.00