On the (M,D) number of a graph.
Sudhahar, P. Arul Paul
For a connected graph G = (V, E), a monophonic set of G is a set M ⊆ V (G) such that every vertex of G is contained in a monophonic path joining some pair of vertices in M. A subset D of vertices in G is called dominating set if every vertex not in D has at least one neighbour in D. A monophonic dominating set M is both a monophonic and a dominating set. The monophonic, dominating, monophonic domination number m(G), γ(G), γm(G) respectively are the minimum cardinality of the respective sets in G. Monophonic domination number of certain classes of graphs are determined. Connected graph of order p with monophonic domination number p− 1 or p is characterised. It is shown that for every two intigers a, b ≥ 2 with 2 ≤ a ≤ b, there is a connected graph G such that γm(G) = a and γg(G) = b, where γg(G) is the geodetic domination number of a graph.
MetadataShow full item record
Showing items related by title, author, creator and subject.
Cerda-Morales, Gamaliel. Proyecciones (Antofagasta, On line); Vol 39 No 2 (2020); 409-420
Committee, Editorial. Austral Journal of Veterinary Sciences; Vol. 51 Núm. 2 (2019); V
Effect of test year, parity number and days in milk on somatic cell count in dairy cows of Los Ríos region in Chile Sebastino, Kiala B.; Uribe, Héctor; González, Humberto H.. Austral Journal of Veterinary Sciences; Vol. 52 Núm. 1 (2020); 1-7