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

CONNECTED DOMINATING INDEPENDENT NEIGHBORHOOD POLYNOMIAL OF GRAPHS

Authors

  • Roxanne A. Anunciado
  • Rosalio G. Artes, Jr

Keywords:

connected dominating set, independent set, connected dominating independent neighborhood polynomial.

DOI:

https://doi.org/10.17654/0974165823036

Abstract

In this paper, we introduce the concept of connected dominating independent neighborhood polynomial of a graph and obtain the same for some classes of graphs.

Received: March 10, 2023;
Accepted: April 22, 2023;

References

N. Abdulcarim, S. Dagondon and E. Chacon, On the independent neighborhood polynomial of the Cartesian product of some special graphs, European Journal of Pure and Applied Mathematics 14(1) (2021), 173-191.

S. Alikhani and Y. Peng, Introduction to domination polynomial of a graph, Ars Combin. 114 (2014), 257-266.

R. G. Artes, Jr., M. A. Langamin and A. B. Calib-og, Clique common neighborhood polynomial of graphs, Advances and Applications in Discrete Mathematics 35 (2022), 77-85.

J. A. Bondy and U. S. R. Murty, Graph Theory and Related Topics, Academic Press, New York, 1979.

J. Brown and R. Nowakowski, The neighborhood polynomial of a graph, Australas. J. Combin. 42 (2008), 55-68.

J. Ellis-Monaghan and J. Merino, Graph Polynomials and their Applications II: Interrelations and Interpretations, Birkhauser, Boston, 2011.

J. L. Gross and J. Yellen, Graph Theory and its Applications, Chapman & Hall, New York, 2006.

I. Gutman, Graphs and graph polynomials of interest in chemistry, Gottfried Tinhofer and Gunther Schmidt, ed., Lecture Notes in Computer Science, Berlin, Springer-Verlag, 2005, pp. 177-187.

F. Harary and T. Haynes, Double domination in graphs, Ars Combin. 55 (2000), 201-213.

C. Hoede and X. Li, Clique polynomials and independent set polynomials of graphs, Discrete Math. 125 (1994), 219-228.

A. Vijayan and M. Felix Nes Mabel, Connected domination polynomial of some graphs, IOSR Journal of Mathematics 12(III) (2016), 13-16.

Downloads

Published

2023-05-13

Issue

Vol. 39 No. 1 (2023)

Section

Articles

License

Copyright (c) 2023 Pushpa Publishing House, Prayagraj, India

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

_________________________

Licensing Terms:

Attribution: Credit Pushpa Publishing House as the original publisher, including title and author(s) if applicable.

Contact Pushpa Publishing House for more info or permissions.

How to Cite

CONNECTED DOMINATING INDEPENDENT NEIGHBORHOOD POLYNOMIAL OF GRAPHS. (2023). Advances and Applications in Discrete Mathematics, 39(1), 73-80. https://doi.org/10.17654/0974165823036

Similar Articles

1-10 of 127

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