Minimum Equitable Dominating Partition Energy of a Graph

Authors

  • Sashi Kanth Reddy Avula Department of Computer Science, JAIN University, Bangalore
  • P. Siva Kota Reddy Department of Mathematics, Siddaganga Institute of Technology, Tumkur 572103
  • K. N. Prakasha Department of Mathematics, Vidyavardhaka College of Engineering, Mysuru 570002

DOI:

https://doi.org/10.26713/jims.v10i1-2.566

Keywords:

Minimum equitable dominating set, Minimum equitable dominating \(k\)-partition eigenvalues, Minimum equitable dominating k-partition energy, k-Complement, \(k(i)\)-Complement

Abstract

The partition energy of a graph was introduced by Sampathkumar et al. [12]. Motivated by this, we introduce the concept of minimum equitable dominating partition energy of a graph, \(E^E_p (G)\) and compute the minimum equitable dominating partition energy \(E^E_p (G)\) of few families of graphs. Also, we establish the bounds for minimum equitable dominating partition energy.

Downloads

Download data is not yet available.

References

C. Adiga and M. Smitha, On maximum degree energy of a graph, Int. J. Contemp. Math. Sci. 4 (8) (2009), 385 – 396.

C. Adiga and C.S. Shivakumaraswamy, Bounds on the largest minimum degree eigenvalues of graphs, Int. Math. Forum 5 (37) (2010), 1823 – 1831.

C. Adiga, R. Balakrishnan and W. So, The skew energy of a digraph, Linear Algebra Appl. 432 (2010), 1825 – 1835.

C. Adiga, A. Bayad, I. Gutman and A.S. Shrikanth, The minimum covering energy of a graph, Kragujevac J. Sci. 34 (2012), 39 – 56.

C. Adiga, E. Sampathkumar, M.A. Sriraj and A.S. Shrikanth, Color energy of a graph, Proceedings of the Jangjeon Math. Soc. 16 (3) (2013), 335 – 351.

D.M. Cvetkovic, M. Doob and H. Sachs, Spectra of Graphs - Theory and Application, Academic Press, New York (1980).

P.J. Davis, Circulant Matrices, Wiley, New York (1979).

H.J. Finck and G. Grohmann, Vollständiges Produkt, chromatische Zahl and charakteristisches Polynom reglärer Graphen, II. Wiss. Z. TH Ilmenau 11 (1965), 81 – 87.

I. Gutman, The energy of a graph, Ber. Math. Stat. Sekt. Forschungsz. Graz 103 (1978), 1 – 22.

G. Indulal, I. Gutman and A. Vijayakumar, On distance energy of graphs, Match Commun. Math. Comput. Chem. 60 (2008), 461 – 472.

M.R. Rajesh Kanna, B.N. Dharmendra and G. Sridhara, Minimum dominating energy of a graph, Int. J. Pure Appl. Math. 85 (4) (2013), 707 – 718.

E. Sampathkumar, L. Pushpalatha and C.V. Venkatachalam, P. Bhat, Generalized complements of a graph, Indian J. Pure Appl. Math. 29 (6) (1998), 625 – 639.

E. Sampathkumar, S.V. Roopa, K.A. Vidya and M.A. Sriraj, Partition energy of a graph, Proceedings of the Jangjeon Math. Soc. 16 (3) (2013), 335 – 351.

E. Sampathkumar and M.A. Sriraj, Vertex labeled/colored graphs, matrices and signed Graphs, J. Comb. Inf. Syst. Sci. 38 (2014), 113 – 120.

B. Zhou and I. Gutman, On Laplacian energy of graphs, Match Commun. Math. Comput. Chem. 57 (2007), 211 – 220.

Downloads

Published

2018-04-30
CITATION

How to Cite

Avula, S. K. R., Reddy, P. S. K., & Prakasha, K. N. (2018). Minimum Equitable Dominating Partition Energy of a Graph. Journal of Informatics and Mathematical Sciences, 10(1-2), 13–22. https://doi.org/10.26713/jims.v10i1-2.566

Issue

Vol. 10 No. 1-2 (2018)

Section

Research Articles

License

Authors who publish with this journal agree to the following terms:
  • Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a CCAL that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
  • Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
  • Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work.