The open monophonic chromatic number of a graph
A set P of vertices in a connected graph G is called open monophonic chromatic set if P is both an open monophonic set and a chromatic set. The minimum cardinality among the set of all open monophonic chromatic sets is called open monophonic chromatic number and is denoted by χom(G). Here properties...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
University of Mohaghegh Ardabili
2023-12-01
|
| Series: | Journal of Hyperstructures |
| Subjects: | |
| Online Access: | https://jhs.uma.ac.ir/article_2575_745f9f4bb94f57043728cac42176f316.pdf |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!