Search
Now showing items 1-2 of 2
The restrained monophonic number of a graph
(Işık University Press, 2024-01)
A set S of vertices of a connected graph G is a monophonic set of G if each vertex v of G lies on a x?y monophonic path for some x and y in S. The minimum cardinality of a monophonic set of G is the monophonic number of G ...
On the monophonic and monophonic domination polynomial of a graph
(Işık University Press, 2024-01)
A set S of vertices of a graph G is a monophonic set of G if each vertex u of G lies on an u ? v monophonic path in G for some u, v ? S. M ? V (G) is said to be a monophonic dominating set if it is both a monophonic set ...