Advances and Applications in Discrete Mathematics

The Advances and Applications in Discrete Mathematics is a prestigious peer-reviewed journal indexed in the Emerging Sources Citation Index (ESCI). It is dedicated to publishing original research articles in the field of discrete mathematics and combinatorics, including topics such as graphs, coding theory, and block design. The journal emphasizes efficient and powerful tools for real-world applications and welcomes expository articles that highlight current developments in the field.

Submit Article

THE NUMBER OF EQUI-NEIGHBOR SETS OF GRAPHS

Authors

  • P. Dhanya
  • V. Anil Kumar

Keywords:

$i$-equi-neighbor set, equi-neighbor polynomial.

DOI:

https://doi.org/10.17654/0974165824020

Abstract

In this paper, we define the $i$-equi-neighbor set and the equi-neighbor polynomial of a graph. Moreover, we find the equi-neighbor polynomial of some graphs.

Received: January 29, 2024
Revised: February 8, 2024
Accepted: March 11, 2024

References

K. Priya and V. Anil Kumar, The number of CC-dominating sets of some graphs, South East Asian J. Math. Math. Sci. 19(2) (2023), 211-222.

M. Shikhi and V. Anil Kumar, CNP equivalent classes of graphs, South East Asian J. Math. Math. Sci. 13(2) (2017), 75-84.

M. Shikhi and V. Anil Kumar, On the stability of common neighbor polynomial some graphs, South East Asian J. Math. Math. Sci. 14(1) (2018), 95-102.

M. Shikhi and V. Anil Kumar, Common neighbor polynomial of graphs, Far East J. Math. Sci. (FJMS) 102(6) (2007), 1201-1221.

M. Shikhi and V. Anil Kumar, Common neighbor polynomial of graph operations, Far East J. Math. Sci (FJMS) 102(11) (2017), 2629-2641.

J. Devaraj and E. Sukumaran, On vertex polynomial, International J. of Math. Sci. and Engg. Appls (IJMESA) 6(1) (2012), 371-380.

A. M. Anto and P. Paul Hawkins, Vertex polynomial of graphs with new results, Glob. J. Pure Appl. Math. 15(4) (2019), 469-475.

E. A. Leicht, Petter Holme and M. E. J. Newman, Vertex similarity in networks, Physical Review E 73(2) (2006), 026120.

J. Mycielski, Sur le coloriage des graphes, Colloq. Math. 3 (1955), 161-162.

M. P. Shyama and V. Anil Kumar, Total domination polynomials of complete partite graphs, Advances and Applications in Discrete Mathematics 13 (2014), 23-28.

M. P. Shyama and V. Anil Kumar, On the roots of Hosoya polynomials, J. Discrete Math. Sci. Cryptogr. 19 (2016), 199-219.

E. Sampathkumar and H. B. Walikar, On splitting graph of a graph, Karnataka University Journal XXV (1980), 13-16.

Selvam Avadayappan and M. Bhuvaneshwari, Cosplitting graph and coregular graph, International Journal of Mathematics and Soft Computing 5(1) (2015), 57-64.

R. Ponraj and S. Somasundaram, On the degree splitting graph of a graph, Nat. Acad. Sci. Lett. 27(7 and 8) (2004), 275-278.

Published

2024-04-05

Issue

Section

Articles

How to Cite

THE NUMBER OF EQUI-NEIGHBOR SETS OF GRAPHS. (2024). Advances and Applications in Discrete Mathematics, 41(4), 281-302. https://doi.org/10.17654/0974165824020

Similar Articles

1-10 of 118

You may also start an advanced similarity search for this article.