Keywords and phrases: algorithm, deletion, contraction.
Received: January 1, 2024; Accepted: February 6, 2024; Published: February 19, 2024
How to cite this article: Hend Elmorsy, On deletion and contraction of a graph by a new series and its algorithm, Advances and Applications in Discrete Mathematics 41(2) (2024), 157-166. http://dx.doi.org/10.17654/0974165824011
This Open Access Article is Licensed under Creative Commons Attribution 4.0 International License
References:
[1] D. J. A. Welsh, Complexity: knots, colourings, and counting, London Math. Soc. Lecture Note Series, 186, Cambridge University Press, Cambridge, 1993. [2] S. Willerton, Review of Chmutov, Duzhin and Lando, Vassiliev knot invariants: I III, Math. Reviews, 96i57002, 1996. [3] S. Willerton, Vassiliev invariants and the Hopf algebra of chord diagrams, Proc. Cambridge Phil. Soc. 119 (1996), 55-65. [4] E. J. Barbeau, Polynomials, Springer, 2003. [5] R. C. Read, An introduction to chromatic polynomials, J. Combinatorial Theory 4 (1968), 52-71. [6] Saieed Akbari and Mohammad Reza Oboudi, On the edge cover polynomial of graphs, American Mathematical Society, 2010. [7] 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.
|