Forcing polynomial of double hexagonal chains
WebJan 1, 2015 · Afterwards, forcing polynomials of catacondensed hexagonal systems [24], benzenoid parallelograms [27], rectangle grids [26], and (5,6)-fullerene graphs C 60 [19], C 70 [13] and C 72 [18] were ... WebDec 20, 2024 · B = b 0 + b 1 x + ⋯ + b m x m. You have to compute polynomial C = A ⋅ B , which is defined as. C = ∑ i = 0 n ∑ j = 0 m a i b j x i + j = c 0 + c 1 x + ⋯ + c n + m x n + …
Forcing polynomial of double hexagonal chains
Did you know?
WebJun 6, 2024 · In this paper, we derive a recurrence relation of forcing polynomial for double hexagonal chains, which is a hexagonal system constructed by successive triple-edge … WebJun 2, 2024 · Besides, since each edge of S belongs to exactly two faces of P ( p , q) and the boundary of each face of P ( p , q) has two edges of S, we have 2 S =2 (n+1), and …
WebMatching forcing polynomials of constructable hexagonal systems Shuang Zhao∗ School of Information Engineering, Lanzhou University of Finance and Economics, Lanzhou, … WebApr 10, 2024 · The maximum anti-forcing number of a benzenoid system H equals the Fries number of H. Hwang et al. defined the anti-forcing polynomial of a graph as a counting polynomial for perfect matchings ...
WebFeb 1, 2024 · In this paper, we derive a recurrence relation of forcing polynomial for double hexagonal chains, which is a hexagonal system constructed by successive triple-edge fusions of naphthalenes. WebJan 1, 2024 · PDF On Jan 1, 2024, 振云 韩 published The Anti-Forcing Numbers of the Edge Deleted Ladder Graphs and the “L” Type Ladder Graphs Find, read and cite all the research you need on ResearchGate
WebDec 31, 2008 · The maximum anti-forcing number of a benzenoid system H equals the Fries number of H. Hwang et al. defined the anti-forcing polynomial of a graph as a counting polynomial for perfect matchings with the same anti-forcing number, and obtained explicit expressions of the anti-forcing polynomial of hexagonal chains and …
WebJul 15, 2024 · The forcing spectrum of hexagonal systems with the minimum forcing number one [28], tubular (4, 6)-fullerenes T n with cyclic edge-connectivity 3 [14] and (3, … peter scheddingWebJun 1, 2005 · In particular, explicit expressions of the forcing polynomial and asymptotic behavior of the innate degree of freedom for zigzag hexagonal chains are obtained. View Show abstract peter schaub authorWebA catacondensed hexagonal system with no branched hexagons is called a hexagonal chain (see Fig. 1(b)). A hexagonal chain with no kinks is called linear, and furthermore a linear hexagonal chain Win His called maximal if it is contained in no other linear ones of H. De ne the length of Was the number of hexagons in W, and a vertical edge of W peter schaub park nicolletWebJan 1, 2011 · In a previous paper (He et al., J Math Chem 59:1767–1784, 2024), we presented a complete forcing set of a hexagonal system in terms of elementary edge-cut cover, and a lower bound for the ... stars ct dotWebJul 1, 2024 · As their applications, we obtain explicit formulas for the global forcing numbers of two kinds of hexagonal systems, parallelogram B p,q and zigzag multiple chain Z(k,l), and we prove that the ... peter schavone law west warwick riWebAug 9, 2024 · This paper calculated four counting polynomials of double benzenoid chains: Sadhana, omega, theta, and Padmakar–Ivan (PI). 2. Results and Discussion … stars ctmWebSep 28, 2024 · Matching forcing polynomials of constructable hexagonal systems Shuang Zhao In this paper, we derive recurrence relations of forcing polynomials for monotonic … peter schedule