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

ON DELETION AND CONTRACTION OF A GRAPH BY A NEW SERIES AND ITS ALGORITHM

Authors

  • Hend Elmorsy

Keywords:

algorithm, deletion, contraction.

DOI:

https://doi.org/10.17654/0974165824011

Abstract

In this paper, we discuss the deletion and contraction for a given  graph by a certain series starting with smallest weights (ascending). An algorithm for this process is also introduced.

Received: January 1, 2024
Accepted: February 6, 2024

References

D. J. A. Welsh, Complexity: knots, colourings, and counting, London Math. Soc. Lecture Note Series, 186, Cambridge University Press, Cambridge, 1993.

S. Willerton, Review of Chmutov, Duzhin and Lando, Vassiliev knot invariants: I III, Math. Reviews, 96i57002, 1996.

S. Willerton, Vassiliev invariants and the Hopf algebra of chord diagrams, Proc. Cambridge Phil. Soc. 119 (1996), 55-65.

E. J. Barbeau, Polynomials, Springer, 2003.

R. C. Read, An introduction to chromatic polynomials, J. Combinatorial Theory 4 (1968), 52-71.

Saieed Akbari and Mohammad Reza Oboudi, On the edge cover polynomial of graphs, American Mathematical Society, 2010.

S. Biswas, P. J. Cameron, A. Das and H. K. Dey, On difference of enhanced power graph and power graph of a finite group, Combinatorics (math.CO), 2022, pp. 1-27.

Downloads

Published

2024-02-19

Issue

Vol. 41 No. 2 (2024)

Section

Articles

License

Copyright (c) 2024 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

ON DELETION AND CONTRACTION OF A GRAPH BY A NEW SERIES AND ITS ALGORITHM. (2024). Advances and Applications in Discrete Mathematics, 41(2), 157-166. https://doi.org/10.17654/0974165824011

Similar Articles

1-10 of 21

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