共查询到20条相似文献,搜索用时 15 毫秒
1.
The independence polynomial of a graph is the generating function of the numbers of independent sets of each size. A graph of order is very well-covered if every maximal independent set has size . Levit and Mandrescu conjectured that the independence polynomial of every very well-covered graph is unimodal (that is, the sequence of coefficients is nondecreasing, then nonincreasing). In this article we show that every graph is embeddable as an induced subgraph of a very well-covered graph whose independence polynomial is unimodal, by considering the location of the roots of such polynomials. 相似文献
2.
《Discrete Mathematics》2023,346(1):113143
The independence equivalence class of a graph G is the set of graphs that have the same independence polynomial as G. A graph whose independence equivalence class contains only itself, up to isomorphism, is independence unique. Beaton, Brown and Cameron [2] showed that paths with an odd number of vertices are independence unique and raised the problem of finding the independence equivalence class of paths with an even number of vertices. The problem is completely solved in this paper. 相似文献
3.
《Discrete Mathematics》2021,344(12):112605
The independence equivalence class of a graph G is the set of graphs that have the same independence polynomial as G. Beaton, Brown and Cameron (2019) found the independence equivalence classes of even cycles, and raised the problem of finding the independence equivalence class of odd cycles. The problem is completely solved in this paper. 相似文献
4.
The independence polynomial of a (finite) graph is the generating function for the number of independent sets of each cardinality. Assuming that each possible edge of a complete graph of order n is independently operational with probability p, we consider the expected independence polynomial. We show here that for all fixed , the expected independence polynomials of complete graphs have all real, simple roots. 相似文献
5.
Roland Glantz 《Discrete Mathematics》2006,306(24):3253-3266
The recursive computation of the interlace polynomial introduced by Arratia, Bollobás and Sorkin is defined in terms of a new pivoting operation on undirected simple graphs. In this paper, we interpret the new pivoting operation on graphs in terms of standard pivoting (on matrices). Specifically, we show that, up to swapping vertex labels, Arratia et al.'s pivoting operation on a graph is equivalent to a principal pivot transform on the graph's adjacency matrix, provided that all computations are performed in the Galois field F2. Principal pivoting on adjacency matrices over F2 has a natural counterpart on isotropic systems. Thus, our view of the interlace polynomial is closely related to the one by Aigner and van der Holst.The observations that adjacency matrices of undirected simple graphs are skew-symmetric in F2 and that principal pivoting preserves skew-symmetry in all fields suggest to extend Arratia et al.'s pivoting operation to fields other than F2. Thus, the interlace polynomial extends to polynomials on gain graphs, namely bidirected edge-weighted graphs whereby reversed edges carry non-zero weights that differ only by their sign. Extending a proof by Aigner and van der Holst, we show that the extended interlace polynomial can be represented in a non-recursive form analogous to the non-recursive form of the original interlace polynomial, i.e., the Martin polynomial.For infinite fields it is shown that the extended interlace polynomial does not depend on the (non-zero) gains, as long as they obey a non-singularity condition. These gain graphs are all supported by a single undirected simple graph. Thus, a new graph polynomial is defined for undirected simple graphs. The recursive computation of the new polynomial can be done such that all ends of the recursion correspond to independent sets. Moreover, its degree equals the independence number. However, the new graph polynomial is different from the independence polynomial. 相似文献
6.
研究了图的独立集多项式的单峰性,给出具有爪图结构的几类图的独立集多项式等价的无爪图,并在此基础上证明了两类具有爪图结构的树T(n,n+1,m)和T(I,i+1,k,j,j+1)的独立集多项式具有单峰性,从而为具有爪图结构的其它树的单峰性提供了一个证明方法. 相似文献
7.
Richard Arratia Bla Bollobs Gregory B. Sorkin 《Journal of Combinatorial Theory, Series B》2004,92(2):199-233
Motivated by circle graphs, and the enumeration of Euler circuits, we define a one-variable “interlace polynomial” for any graph. The polynomial satisfies a beautiful and unexpected reduction relation, quite different from the cut and fuse reduction characterizing the Tutte polynomial.It emerges that the interlace graph polynomial may be viewed as a special case of the Martin polynomial of an isotropic system, which underlies its connections with the circuit partition polynomial and the Kauffman brackets of a link diagram. The graph polynomial, in addition to being perhaps more broadly accessible than the Martin polynomial for isotropic systems, also has a two-variable generalization that is unknown for the Martin polynomial. We consider extremal properties of the interlace polynomial, its values for various special graphs, and evaluations which relate to basic graph properties such as the component and independence numbers. 相似文献
8.
In a recent paper, the first author proved the log-concavity of the coefficients of the characteristic polynomial of a matroid realizable over a field of characteristic 0, answering a long-standing conjecture of Read in graph theory. We extend the proof to all realizable matroids, making progress towards a more general conjecture of Rota?CHeron?CWelsh. Our proof follows from an identification of the coefficients of the reduced characteristic polynomial as answers to particular intersection problems on a toric variety. The log-concavity then follows from an inequality of Hodge type. 相似文献
9.
Iain Moffatt 《Discrete Mathematics》2010,310(1):174-183
Recently S. Chmutov introduced a generalization of the dual of a ribbon graph (or equivalently an embedded graph) and proved a relation between Bollobás and Riordan’s ribbon graph polynomial of a ribbon graph and of its generalized duals. Here I show that the duality relation satisfied by the ribbon graph polynomial can be understood in terms of knot theory and I give a simple proof of the relation which used the homfly polynomial of a knot. 相似文献
10.
The independence polynomial of a graph G is the generating function I(G,x)=∑k≥0ikxk, where ik is the number of independent sets of cardinality k in G. We show that the problem of evaluating the independence polynomial of a graph at any fixed non-zero number is intractable, even when restricted to circulants. We provide a formula for the independence polynomial of a certain family of circulants, and its complement. As an application, we derive a formula for the number of chords in an n-tet musical system (one where the ratio of frequencies in a semitone is 21/n) without ‘close’ pitch classes. 相似文献
11.
Ludwin A.BASILIO-HERNáNDEZ Walter CARBALLOSA Jesús LEA?OS José M.SIGARRETA 《数学学报(英文版)》2019,35(3):338-354
We introduce the differential polynomial of a graph. The differential polynomial of a graph G of order n is the polynomial B(G; x) :=∑?(G)k=-nB_k(G) x~(n+k), where B_k(G) denotes the number of vertex subsets of G with differential equal to k. We state some properties of B(G;x) and its coefficients.In particular, we compute the differential polynomial for complete, empty, path, cycle, wheel and double star graphs. We also establish some relationships between B(G; x) and the differential polynomials of graphs which result by removing, adding, and subdividing an edge from G. 相似文献
12.
Norman Biggs 《Journal of Algebraic Combinatorics》1999,10(2):115-133
The 'dollar game' represents a kind of diffusion process on a graph. Under the rules of the game some cofigurations are both stable and recurrent, and these are known as critical cofigurations. The set of critical configurations can be given the structure of an abelian group, and it turns out that the order of the group is the tree-number of the graph. Each critical configuration can be assigned a positive weight, and the generating function that enumerates critical configurations according to weight is a partial evaluation of the Tutte polynomial of the graph. It is shown that the weight enumerator can also be interpreted as a growth function, which leads to the conclusion that the (partial) Tutte polynomial itself is a growth function. 相似文献
13.
Anna de Mier 《Discrete Mathematics》2005,301(1):57-65
We prove that if a graph H has the same Tutte polynomial as the line graph of a d-regular, d-edge-connected graph, then H is the line graph of a d-regular graph. Using this result, we prove that the line graph of a regular complete t-partite graph is uniquely determined by its Tutte polynomial. We prove the same result for the line graph of any complete bipartite graph. 相似文献
14.
Daniel Andrén 《Discrete Applied Mathematics》2009,157(11):2515-2524
In this paper we discuss the two variable Ising polynomials in a graph theoretical setting. This polynomial has its origin in physics as the partition function of the Ising model with an external field. We prove some basic properties of the Ising polynomial and demonstrate that it encodes a large amount of combinatorial information about a graph. We also give examples which prove that certain properties, such as the chromatic number, are not determined by the Ising polynomial. Finally we prove that there exist large families of non-isomorphic planar triangulations with identical Ising polynomial. 相似文献
15.
We consider cyclic graphs, that is, graphs with cyclic ordersat the vertices, corresponding to 2-cell embeddings of graphsinto orientable surfaces, or combinatorial maps. We constructa three variable polynomial invariant of these objects, thecyclic graph polynomial, which has many of the useful propertiesof the Tutte polynomial. Although the cyclic graph polynomialgeneralizes the Tutte polynomial, its definition is very different,and it depends on the embedding in an essential way. 2000 MathematicalSubject Classification: 05C10. 相似文献
16.
Péter Csikvári 《Journal of Graph Theory》2013,74(1):81-103
In this article, we study problems where one has to prove that certain graph parameter attains its maximum at the star and its minimum at the path among the trees on a fixed number of vertices. We give many applications of the so‐called generalized tree shift which seems to be a powerful tool to attack the problems of the above‐mentioned kind. We show that the generalized tree shift increases the largest eigenvalue of the adjacency matrix and Laplacian matrix, decreases the coefficients of the characteristic polynomials of these matrices in absolute value. We will prove similar theorems for the independence polynomial and the edge cover polynomial. The generalized tree shift induces a partially ordered set on trees having fixed number of vertices. The smallest element of this poset is the path, largest element is the star. Hence, the above‐mentioned results imply the extremality of the path and the star for these parameters. 相似文献
17.
Let G be a well covered graph, that is, all maximal independent sets of G have the same cardinality, and let ik denote the number of independent sets of cardinality k in G. We investigate the roots of the independence polynomial i(G, x) = ikxk. In particular, we show that if G is a well covered graph with independence number , then all the roots of i(G, x) lie in in the disk |z| (this is far from true if the condition of being well covered is omitted). Moreover, there is a family of well covered graphs (for each ) for which the independence polynomials have a root arbitrarily close to –. 相似文献
18.
谭尚旺 《纯粹数学与应用数学》2009,25(2):209-216
给出了赋权有向图邻接矩阵特征多项式的图论计算公式,从而得到了一般矩阵特征多项式的图论计算方法,并且研究了赋权有向图邻接矩阵特征多项式和谱半径的一些性质. 相似文献
19.
本文证明了3-连通非偶图的色多项式根2的阶为1;满足一定条件的非3-连通非偶图的色多项式根2的阶是图的非偶块和非偶可分块数.从而,把色多项式P(G)中1的阶是图G的非平凡块数这一结果进一步加以推广. 相似文献
20.
图T1,1,m与Q(3,n)中有路因子的充分必要条件及T1,1,m的匹配等价类 总被引:1,自引:0,他引:1
如果一个图的匹配多项式可以被一个路的匹配多项式整除,我们就称此路是该图的一个路因子,路因子在刻画图的匹配等价类,研究匹配唯一性方面有很重要的作用.本文得到了图T1,1.m与图Q(3,n)中有路因子的充分必要条件. 相似文献