About: Graph polynomial

Facets (new session)
Description
Metadata
Settings
- Rule:
- Inverse Functional Properties:
- "Same As":

About: Graph polynomial Goto Sponge NotDistinct Permalink

An Entity of Type : owl:Thing, within Data Space : dbpedia.demo.openlinksw.com associated with source document(s)
QRcode icon

http://dbpedia.demo.openlinksw.com/describe/?url=http%3A%2F%2Fdbpedia.org%2Fresource%2FGraph_polynomial&invfp=IFP_OFF&sas=SAME_AS_OFF

In mathematics, a graph polynomial is a graph invariant whose values are polynomials. Invariants of this type are studied in algebraic graph theory.Important graph polynomials include: * The characteristic polynomial, based on the graph's adjacency matrix. * The chromatic polynomial, a polynomial whose values at integer arguments give the number of colorings of the graph with that many colors. * The dichromatic polynomial, a 2-variable generalization of the chromatic polynomial * The flow polynomial, a polynomial whose values at integer arguments give the number of nowhere-zero flows with integer flow amounts modulo the argument. * The (inverse of the) Ihara zeta function, defined as a product of binomial terms corresponding to certain closed walks in a graph. * The , used by Pierre

Attributes	Values
rdfs:label	Graph polynomial (en)
rdfs:comment	In mathematics, a graph polynomial is a graph invariant whose values are polynomials. Invariants of this type are studied in algebraic graph theory.Important graph polynomials include: * The characteristic polynomial, based on the graph's adjacency matrix. * The chromatic polynomial, a polynomial whose values at integer arguments give the number of colorings of the graph with that many colors. * The dichromatic polynomial, a 2-variable generalization of the chromatic polynomial * The flow polynomial, a polynomial whose values at integer arguments give the number of nowhere-zero flows with integer flow amounts modulo the argument. * The (inverse of the) Ihara zeta function, defined as a product of binomial terms corresponding to certain closed walks in a graph. * The , used by Pierre (en)
dcterms:subject	Graph invariants Polynomials
Wikipage page ID	56012962 (xsd:integer)
Wikipage revision ID	841879539 (xsd:integer)
Link from a Wikipage to another Wikipage	Nowhere-zero flow Euler tour Algebraic graph theory Characteristic polynomial Induced subgraph Graph invariants Matching (graph theory) Chromatic polynomial Generating function Matching polynomial Adjacency matrix Graph property Knot polynomial Flow polynomial Polynomials Polynomial Tutte polynomial Dichromatic polynomial Ihara zeta function Reliability polynomial dbr:Martin_polynomial
sameAs	Graph polynomial Graph polynomial Graph polynomial
dbp:wikiPageUsesTemplate	dbt:R dbt:Reflist dbt:Sia
has abstract	In mathematics, a graph polynomial is a graph invariant whose values are polynomials. Invariants of this type are studied in algebraic graph theory.Important graph polynomials include: * The characteristic polynomial, based on the graph's adjacency matrix. * The chromatic polynomial, a polynomial whose values at integer arguments give the number of colorings of the graph with that many colors. * The dichromatic polynomial, a 2-variable generalization of the chromatic polynomial * The flow polynomial, a polynomial whose values at integer arguments give the number of nowhere-zero flows with integer flow amounts modulo the argument. * The (inverse of the) Ihara zeta function, defined as a product of binomial terms corresponding to certain closed walks in a graph. * The , used by Pierre Martin to study Euler tours * The matching polynomials, several different polynomials defined as the generating function of the matchings of a graph. * The reliability polynomial, a polynomial that describes the probability of remaining connected after independent edge failures * The Tutte polynomial, a polynomial in two variables that can be defined (after a small change of variables) as the generating function of the numbers of connected components of induced subgraphs of the given graph, parameterized by the number of vertices in the subgraph. (en)
prov:wasDerivedFrom	wikipedia-en:Graph_polynomial?oldid=841879539&ns=0
page length (characters) of wiki page	1941 (xsd:nonNegativeInteger)
foaf:isPrimaryTopicOf	wikipedia-en:Graph_polynomial
is Link from a Wikipage to another Wikipage of	Chromatic polynomial Matching polynomial Jo Ellis-Monaghan Knot polynomial Tutte polynomial Ihara zeta function
is foaf:primaryTopic of	wikipedia-en:Graph_polynomial

Faceted Search & Find service v1.17_git139 as of Feb 29 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 08.03.3330 as of Mar 19 2024, on Linux (x86_64-generic-linux-glibc212), Single-Server Edition (378 GB total memory, 60 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software