The Edge Nomatic Number of Graph

N.Pratap Babu Rao

doi:https://doi.org/10.14445/22315373/IJMTT-V65I1P504

International Journal of Mathematics Trends and Technology

Research Article | Open Access | Download PDF

Volume 65 | Issue 1 | Year 2019 | Article Id. IJMTT-V65I1P504 | DOI : https://doi.org/10.14445/22315373/IJMTT-V65I1P504

The Edge Nomatic Number of Graph

N.Pratap Babu Rao

Citation :

N.Pratap Babu Rao, "The Edge Nomatic Number of Graph," International Journal of Mathematics Trends and Technology (IJMTT), vol. 65, no. 1, pp. 13-14, 2019. Crossref, https://doi.org/10.14445/22315373/IJMTT-V65I1P504

Abstract

The line domatic number of a graph is the maximum order of a partition of the edge set into dominating sets. Analogously the edge nomadic number of a graph is the maximum order of a partition of the edge set into edge neighborhood sets. This number is determined for various graphs and some bounds are obtained .Also Nordhus Gaddum type result is established for the edge nomatic number.

Keywords

graph G, Edge, Nordhus Gaddum

References

[1] C .Berge, Graphs and Hyper graph, North Holland, Amsterdam.
[2] E.J. Cockayne and S.T. Hedetneimi, towards a theory of Domination in Graphs Networks (1977).
[3] F.Harary, Graph theory Addison Wesley Reading mass (1972).
[4] S.R .Jay ram, The nomatic number of a graph Nat, Acad. Sci -letters Vol 10 No.1 91987).
[5] E. Sampathkumar and P.S.Neerlagi, line neighborhood number of graph Indian J. pure.app;.math 17(2) 142-149.
[6] Development in the theory of Domination in graph. M.R.I.Lecture notes No.1 Mehta research institute Allahabad.