On the theory of the matching polynomial
From MaRDI portal
Publication:3912832
DOI10.1002/jgt.3190050203zbMath0462.05051OpenAlexW2118302283MaRDI QIDQ3912832
Publication date: 1981
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.3190050203
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (only showing first 100 items - show all)
A unified approach to multivariate polynomial sequences with real stability ⋮ Matching Energy of Graphs with Maximum Degree at Most 3 ⋮ The matching polynomials of hypergraphs and weighted hypergraphs ⋮ Matchings in starlike trees ⋮ The \(k\)-fractal of a simplicial complex ⋮ Distinctive power of the alliance polynomial for regular graphs ⋮ Approximating real-rooted and stable polynomials, with combinatorial applications ⋮ Analytic properties of sextet polynomials of hexagonal systems ⋮ Matching polynomials: A matrix approach and its applications ⋮ The heat equation and Stein's identity: connections, applications ⋮ The energy of some tree dendrimers ⋮ Spectral properties of some structurally related graphs ⋮ Central and local limit theorems for the coefficients of polynomials associated with the Laguerre ones ⋮ Spectra of weighted uniform hypertrees ⋮ A unified approach to polynomial sequences with only real zeros ⋮ On the matching polynomial and its relation to the rook polynomial ⋮ On a conjecture of Wilf ⋮ The matching polynomial of a polygraph ⋮ On the ordering of graphs with respect to their matching numbers ⋮ Extending the characteristic polynomial for characterization of C\(_{20}\) fullerene congeners ⋮ THE MULTIPLICITY OF ZERO ROOTS OF MATCHING POLYNOMIAL OF A GRAPH ⋮ The signless Laplacian coefficients and the incidence energy of unicyclic graphs with given pendent vertices ⋮ On the location of roots of independence polynomials ⋮ Graphs with few matching roots ⋮ More connections between the matching polynomial and the chromatic polynomial ⋮ On sequences of polynomials arising from graph invariants ⋮ Extensions of barrier sets to nonzero roots of the matching polynomial ⋮ Maxima and minima of the Hosoya index and the Merrifield-Simmons index ⋮ On matching integral graphs ⋮ Enumeration of matchings in families of self-similar graphs ⋮ Unnamed Item ⋮ Null decomposition of trees ⋮ Farrell polynomials on graphs of bounded tree width ⋮ Matchings in graphs with a given number of cuts ⋮ Benjamini-Schramm continuity of root moments of graph polynomials ⋮ Two remarks on the adjoint polynomial ⋮ The characteristic polynomial and the matchings polynomial of a weighted oriented graph ⋮ The independence fractal of a graph. ⋮ Combinatorics of \((q,y)\)-Laguerre polynomials and their moments ⋮ Closed formulas for the numbers of small independent sets and matchings and an extremal problem for trees ⋮ On the signless Laplacian coefficients of unicyclic graphs ⋮ Gallai-Edmonds structure theorem for weighted matching polynomial ⋮ Computing the average parallelism in trace monoids. ⋮ Weakly distinguishing graph polynomials on addable properties ⋮ Hermite polynomials and a duality relation for matchings polynomials ⋮ Graphs whose certain polynomials have few distinct roots ⋮ The partition polynomial of a finite set system ⋮ On ordering of complements of graphs with respect to matching numbers ⋮ A fast numerical method for fractional partial integro-differential equations with spatial-time delays ⋮ Extremal double hexagonal chains with respect to \(k\)-matchings and \(k\)-independent sets ⋮ On the differential polynomial of a graph ⋮ Growth rates of geometric grid classes of permutations ⋮ On the main spectrum of generalized Bethe trees ⋮ On the ordering of a class of graphs with respect to their matching numbers ⋮ Further results on the largest matching root of unicyclic graphs ⋮ Some problems on Cayley graphs ⋮ On the roots of independence polynomials of almost all very well-covered graphs ⋮ Solution to a problem on skew spectral radii of oriented graphs ⋮ Graphs with integer matching polynomial zeros ⋮ Alliance polynomial of regular graphs ⋮ Higher-order matching polynomials and \(d\)-orthogonality ⋮ Bounds on the largest root of the matching polynomial ⋮ A note on the number of matchings and independent sets in trees ⋮ Asymptotic enumeration of Latin rectangles ⋮ Generalization of matching extensions in graphs -- combinatorial interpretation of orthogonal and \(q\)-orthogonal polynomials ⋮ A novel graph-operational matrix method for solving multidelay fractional differential equations with variable coefficients and a numerical comparative survey of fractional derivative types ⋮ Unnamed Item ⋮ Extremal energies of trees with a given domination number ⋮ Asymptotic normality of the coefficients of polynomials associated with the Gegenbauer ones ⋮ The matching energy of a graph ⋮ A logician's view of graph polynomials ⋮ Extremal matching energy of complements of trees ⋮ Upper bounds of the energy of triangle-free graphs in terms of matching number ⋮ Quantum holography and neurocomputer architectures ⋮ The matching energy of graphs with given parameters ⋮ New Graph Polynomials from the Bethe Approximation of the Ising Partition Function ⋮ Research problems from the 18th British Combinatorial Conference ⋮ Semantic Equivalence of Graph Polynomials Definable in Second Order Logic ⋮ Lower bounds on matching energy of graphs ⋮ On the stochastic independence properties of hard-core distributions ⋮ Matching polynomials of two classes of graphs ⋮ Multivariate matching polynomials of cyclically labelled graphs ⋮ Developments in the theory of graph spectra ⋮ Even subgraph expansions for the flow polynomial of cubic plane maps ⋮ Extremal matching energy and the largest matching root of complete multipartite graphs ⋮ Matching behaviour is asymptotically normal ⋮ Unnamed Item ⋮ Roots of independence polynomials of well covered graphs ⋮ Gibbs' Measures on Combinatorial Objects and the Central Limit Theorem for an Exponential Family of Random Trees ⋮ An asymptotic independence theorem for the number of matchings in graphs ⋮ On the location of zeros of the Laplacian matching polynomials of graphs ⋮ Reconstructing subgraph-counting graph polynomials of increasing families of graphs ⋮ Unnamed Item ⋮ Spectrahedrality of hyperbolicity cones of multivariate matching polynomials ⋮ Solution to a conjecture on the maximum skew-spectral radius of odd-cycle graphs ⋮ Computer generation of all 1-factors for a class of graphs with all vertices of degree two or three ⋮ Bipartition polynomials, the Ising model, and domination in graphs ⋮ On the Laplacian coefficients of signed graphs ⋮ A refined Gallai-Edmonds structure theorem for weighted matching polynomials ⋮ On equienergetic signed graphs
Cites Work
This page was built for publication: On the theory of the matching polynomial
