Semantic Equivalence of Graph Polynomials Definable in Second Order Logic (Q2820700)

From MaRDI portal

Revision as of 14:10, 12 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Semantic Equivalence of Graph Polynomials Definable in Second Order Logic	scientific article

Statements

scholarly article

0 references

Semantic Equivalence of Graph Polynomials Definable in Second Order Logic (English)

0 references

Logic, Language, Information, and Computation

0 references

publication date

9 September 2016

0 references

Johann A. Makowsky

0 references

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-662-52921-8_18

0 references

\(\lambda_ 1\), isoperimetric inequalities for graphs, and superconcentrators

0 references

An extension of the bivariate chromatic polynomial

0 references

0 references

0 references

Applications of stable polynomials to mixed determinants: Johnson's conjectures, unimodality, and symmetrized Fischer products

0 references

Negative dependence and the geometry of polynomials

0 references

Polynomials with the half-plane property and matroid theory

0 references

Spectra of graphs

0 references

On the location of roots of independence polynomials

0 references

Homogeneous multivariate polynomials with the half-plane property

0 references

On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic

0 references

On the roots of edge cover polynomials of graphs

0 references

0 references

Graph Polynomials and Their Applications I: The Tutte Polynomial

0 references

0 references

Graph Polynomials: From Recursive Definitions to Subset Expansion Formulas

0 references

On the theory of the matching polynomial

0 references

Clique polynomials have a unique root of smallest modulus

0 references

Hyperbolic polynomials approach to Van der Waerden/Schrijver-Valiant like conjectures

0 references

Linear matrix inequality representation of sets

0 references

On stability of Alexander polynomials of knots and links (survey)

0 references

Clique polynomials and independent set polynomials of graphs

0 references

Tutte Polynomials and Link Polynomials

0 references

0 references

Matching theory

0 references

The roots of the independence polynomial of a clawfree graph

0 references

Algorithmic uses of the Feferman-Vaught theorem

0 references

From a zoo to a zoology: Towards a general theory of graph polynomials

0 references

A Computational Framework for the Study of Partition Functions and Graph Polynomials

0 references

On sequences of polynomials arising from graph invariants

0 references

On the location of roots of graph polynomials

0 references

The Equivalence of Two Graph Polynomials and a Symmetric Function

0 references

A weighted graph polynomial from chromatic invariants of knots

0 references

Lee-Yang theorems and the complexity of computing averages

0 references

Bounds on the Complex Zeros of (Di)Chromatic Polynomials and Potts-Model Partition Functions

0 references

Chromatic Roots are Dense in the Whole Complex Plane

0 references

0 references

A Contribution to the Theory of Chromatic Polynomials

0 references

Multivariate stable polynomials: theory and applications

0 references

A criterion for the half-plane property

0 references

Necessary and sufficient conditions for the Hurwitz and Schur stability of interval matrices

0 references

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/978-3-662-52921-8_18

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2820700

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2820700&oldid=36272781"