Yazar "Santhakumaran, A. P." için listeleme
-
The connected detour monophonic number of a graph
Titus, P.; Santhakumaran, A. P.; Ganesamoorthy, K. (Işık University Press, 2016)For a connected graph G = (V, E) of order at least two, a chord of a path P is an edge joining two non-adjacent vertices of P. A path P is called a monophonic path if it is a chordless path. A longest x ? y monophonic path ... -
Minimal restrained monophonic sets in graphs
Santhakumaran, A. P.; Raghu T. Venkata; Ganesamoorthy, K. (Işık University Press, 2021)For a connected graph G = (V, E) of order at least two, a restrained monophonic set S of a graph G is a monophonic set such that either S = V or the subgraph induced by V ?S has no isolated vertices. The minimum cardinality ... -
Minimal restrained monophonic sets in graphs
Santhakumaran, A. P.; Raghu T. Venkata; Ganesamoorthy, K. (Işık University Press, 2022)For a connected graph G = (V, E) of order at least two, a restrained monophonic set S of a graph G is a monophonic set such that either S = V or the subgraph induced by V ?S has no isolated vertices. The minimum cardinality ... -
The restrained monophonic number of a graph
Santhakumaran, A. P.; Titus, P.; Ganesamoorthy, K. (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 ...
