Keywords and phrases: vote-ballot-voting method based on approval voting and arithmetic mean.
Received: October 9, 2022; Accepted: November 4, 2022; Published: November 23, 2022
References: [1] S. Akbari and M. R. Oboudi, On the edge cover polynomial of graphs, European Journal of Combinatorics 34(2) (2013), 297-321. [2] A. Ali and W. A. M. Said, Wiener polynomials for steiner distance of graphs, Jordan Journal Appl. Sci. 8(2) (2006), 64-71. [3] S. Alikhani and T. Hamzeh, On the domination polynomials of complete partite graphs, World Applied Sciences Journal 9(1) (2010), 23-24. [4] R. G. Artes and R. A. Rasid, Balanced biclique polynomial of graphs, Global Journal of Pure and Applied Mathematics 12(5) (2016), 4427-4433. [5] R. G. Artes and R. A. Rasid, Combinatorial approach in counting the balanced bicliques in the join and corona of graphs, Journal of Ultra Scientist of Physical Sciences 29(5) (2017), 192-195. [6] B. Askari and M. Alaeiyan, The vertex domination polynomial and edge domination polynomial of a graph, Acta Universitatis Apulensis (28) (2011), 157 162. [7] J. I. Brown and R. J. Nowakowski, The neighbourhood polynomial of a graph, Australian Journal of Combinatorics 42 (2008), 55-68. [8] J. I. Brown and R. Hoshino, Independence polynomials of circulants with application to music, Elsevier Discrete Mathematics 309 (2009), 2292-2304. [9] G. L. Chia, Some problems on chromatic polynomials, Discrete Mathematics 172 (1997), 39-44. [10] F. M. Dong, M. D. Hendy, K. L. Teo and C. H. C. Little, The vertex-cover polynomial of a graph, Discrete Mathematics 250 (2002), 71-78. [11] E. J. Farell, A note on the clique polynomial and its relation to other graph polynomials, J. Math. Sci. Calcutta 8 (1997), 97-102. [12] Hajiabolhassan and M. L. Mehrabadi, On clique polynomials, Australian Journal of Combinatorics 18 (1998), 313-316. [13] C. Hoede and X. Li, Clique polynomials and independent set polynomials of graphs, Discrete Mathematics 125 (1994), 219-228. [14] B. Lass, Matching polynomials and duality, Combinatorica 24(3) (2004), 427-440. [15] L. S. Laja and A. G. Artes, Jr., Zeros of convex subgraph polynomials, Applied Mathematical Sciences 8(59) (2014), 2917-2923. [16] V. E. Levit and E. Mandrescu, Independence Polynomials of a graph-a survey, Proceedings of the 1st International Conference on Algebraic Informatics, Greece, 2005, pp. 233-254. [17] A. Vijayan and T. Binu Selin, On total edge fixed geodominating sets and polynomials of graphs, International Journal of Mathematics 3(2) (2012), 1495-1501. [18] A. Vijayan and K. D. Vijila, On geodetic sets and polynomials of centipedes, International Journal of Mathematical Archive 3(5) (2012), 1885-1894. [19] Y. Wang and B. Zhu, On the unimodality of independence polynomials of some graphs, European Journal of Combinatorics 30 (2011), 10-20. [20] D. R. Woodal, A zero-free interval for chromatic polynomials, Discrete Mathematics 101 (1992), 333-341.
|