- 期刊
A GENERALIZATION OF THE DICHROMATIC POLYNOMIAL OF A GRAPH
並列摘要
The Subgraph polynomial fo a graph pair (G, H), where H ⊆ G, is defined. By assigning particular weights to the variables, it is shown that this polynomial reduces to the dichromatic polynomial of G. This idea of a graph pair leads to a dual generalization of the dichromatic polynomial.
延伸閱讀
- MAJUMDER, S., & MANDAL, R. (2019). MEROMORPHIC FUNCTIONS WHOSE CERTAIN DIFFERENTIAL POLYNOMIAL SHARE A POLYNOMIAL. Tamkang Journal of Mathematics, 50(2), 165-185. https://doi.org/10.5556/j.tkjm.50.2019.2896
- FARRELL, E. (1989). ON A CLASS OF POLYNOMIALS ASSOCIATED WITH THE CLIQUES IN A GRAPH AND ITS APPLICATIONS. International Journal of Mathematics and Mathematical Sciences, 1989(), 77-84. https://doi.org/10.1155/S0161171289000104
- Farrell, E. J. (1981). A RESULT ON CO-CHROMATIC GRAPHS. International Journal of Mathematics and Mathematical Sciences, 1981(), 365-369. https://doi.org/10.1155/S0161171281000227
- Chen, G. Z. (2017). Discussion of several polynomial discriminants and their graphs [master's thesis, National Taiwan University]. Airiti Library. https://doi.org/10.6342/NTU201703303
- Chen, S. (2011). On the Absolute Sum of Chromatic Polynomial Coefficient of Graphs. International Journal of Mathematics and Mathematical Sciences, 2011(), 382-387-031. https://doi.org/10.1155/2011/271987