一些图的边覆盖多项式的对数凹性研究
Study on Log-Concavity of Edge Covering Polynomials of Some Graphs
DOI: 10.12677/AAM.2021.109309, PDF,   
作者: 岳青华：辽宁师范大学数学学院，辽宁 大连
关键词: 边覆盖多项式；对数凹性；Edge Covering Polynomial； Log-Concavity
摘要: 本文根据不同图形的特点，通过递归的方法研究并给出了它们的边覆盖多项式，并进一步研究了这些多项式的对数凹性，主要包括蜈蚣图，毛虫图，脊椎图，爆竹图等图。
Abstract: According to the characteristics of various graphs, their edge covering polynomials are studied and given by recursive method, we further investigate the log-concavity of the graphs in question, which include centipede graphs, caterpillar graphs, vertebrate graphs and firecracker graphs and so on.
文章引用：岳青华. 一些图的边覆盖多项式的对数凹性研究[J]. 应用数学进展, 2021, 10(9): 2950-2959. https://doi.org/10.12677/AAM.2021.109309

参考文献

[1] Stanley, R.P. (1989) Log-Concave and Unimodal Sequences in Algebra, Combinatorics, and Geometry. Annals of the New York Academy of Sciences, 576, 500-535. [Google Scholar] [CrossRef] 
[2] Brenti, F. (1989) Unimodal, Log-Concave, and Pólya Frequency Sequences in Combinatorics. Memoirs of the American Mathematical Society, 81, 106 p.
[3] Brenti, F. (1994) Log-Concave and Unimodal Sequences in Algebra, Combinatorics, and Geometry. Electronic Contemporary Mathematics, 178, 71-84. [Google Scholar] [CrossRef] 
[4] Brändén, P. (2014) Unimodality, Log-Concavity, Real-Rootedness and Beyond. arXiv:1410.6601.
[5] Hamidoune, Y.O. (1990) On the Number of Independent K-Sets in a Claw-Free Graph. Journal of Combinatorial Theory, 50, 241-244. [Google Scholar] [CrossRef] 
[6] Bahls, P. (2012) On the Independence Polynomials of Path-Like Graphs. The Australasian Journal of Combinatorics, 53, 3-18.
[7] Huh, J. (2012) Milnor Numbers of Projective Hypersurfaces and the Chromatic Polynomial of Graphs. Journal of the American Mathematical Society, 25, 907-927. [Google Scholar] [CrossRef] 
[8] Zhu, B.-X. (2016) Clique Cover Products and Unimodality of Independence Polynomials. Discrete Applied Mathematics, 206, 172-180. [Google Scholar] [CrossRef] 
[9] Akbari, S. and Oboudi, M. (2013) On the Edge Cover Polynomial of a Graph. European Journal of Combinatorics, 34, 297-321. [Google Scholar] [CrossRef] 
[10] Csikvári, P. and Oboudi, M. (2011) On the Roots of Edge Cover Polynomials of Graphs. European Journal of Combinatorics, 32, 1407-1416. [Google Scholar] [CrossRef] 
[11] Wang, Y. and Zhu, B.-X. (2011) On the Unimodality of Independence Polynomials of Some Graphs. European Journal of Combinatorics, 32, 10-20. [Google Scholar] [CrossRef] 
[12] Zhu, Z.F. (2007) The Unimodality of Independence Polynomials of Some Graphs. Australasian Journal of Combinatorics, 38, 27-33.
[13] Levit, V.E. and Mandrescu, E. (2002) On Well-Covered Trees with Unimodal Independence Polynomials. Congressus Numerantium, 159, 193-202.
[14] Levit, V.E. and Mandrescu, E. (2007) A Family of Graphs Whose Independence Polynomials Are Both Palindromic and Unimodal. Carpathian Journal of Mathematics, 23, 108-116.
[15] Zhu, B.-X. and Chen, Y. (2019) Log-Concavity of Independence Polynomials of Some Kinds of Trees. Applied Mathematics and Computation, 342, 35-44. [Google Scholar] [CrossRef] 

为你推荐