ترغب بنشر مسار تعليمي؟ اضغط هنا

A unified construction of semiring-homomorphic graph invariants

80   0   0.0 ( 0 )
 نشر من قبل Tobias Fritz
 تاريخ النشر 2019
  مجال البحث
والبحث باللغة English
 تأليف Tobias Fritz




اسأل ChatGPT حول البحث

It has recently been observed by Zuiddam that finite graphs form a preordered commutative semiring under the graph homomorphism preorder together with join and disjunctive product as addition and multiplication, respectively. This led to a new characterization of the Shannon capacity $Theta$ via Strassens Positivstellensatz: $Theta(bar{G}) = inf_f f(G)$, where $f : mathsf{Graph} to mathbb{R}_+$ ranges over all monotone semiring homomorphisms. Constructing and classifying graph invariants $mathsf{Graph} to mathbb{R}_+$ which are monotone under graph homomorphisms, additive under join, and multiplicative under disjunctive product is therefore of major interest. We call such invariants semiring-homomorphic. The only known such invariants are all of a fractional nature: the fractional chromatic number, the projective rank, the fractional Haemers bounds, as well as the Lovasz number (with the latter two evaluated on the complementary graph). Here, we provide a unified construction of these invariants based on linear-like semiring families of graphs. Along the way, we also investigate the additional algebraic structure on the semiring of graphs corresponding to fractionalization. Linear-like semiring families of graphs are a new concept of combinatorial geometry different from matroids which may be of independent interest.



قيم البحث

اقرأ أيضاً

219 - T. Kotek 2009
The reconstruction conjecture has remained open for simple undirected graphs since it was suggested in 1941 by Kelly and Ulam. In an attempt to prove the conjecture, many graph invariants have been shown to be reconstructible from the vertex-deleted deck, and in particular, some prominent graph polynomials. Among these are the Tutte polynomial, the chromatic polynomial and the characteristic polynomial. We show that the interlace polynomial, the U -polynomial, the universal edge elimination polynomial xi and the colore
Graham-Pollak showed that for $D = D_T$ the distance matrix of a tree $T$, det$(D)$ depends only on its number of edges. Several other variants of $D$, including directed/multiplicative/$q
Graph polynomials are deemed useful if they give rise to algebraic characterizations of various graph properties, and their evaluations encode many other graph invariants. Algebraic: The complete graphs $K_n$ and the complete bipartite graphs $K_{n,n }$ can be characterized as those graphs whose matching polynomials satisfy a certain recurrence relations and are related to the Hermite and Laguerre polynomials. An encoded graph invariant: The absolute value of the chromatic polynomial $chi(G,X)$ of a graph $G$ evaluated at $-1$ counts the number of acyclic orientations of $G$. In this paper we prove a general theorem on graph families which are characterized by families of polynomials satisfying linear recurrence relations. This gives infinitely many instances similar to the characterization of $K_{n,n}$. We also show where to use, instead of the Hermite and Laguerre polynomials, linear recurrence relations where the coefficients do not depend on $n$. Finally, we discuss the distinctive power of graph polynomials in specific form.
In this article we introduce the {it cylindrical construction} for graphs and investigate its basic properties. We state a main result claiming a weak tensor-like duality for this construction. Details of our motivations and applications of the construction will appear elsewhere.
We propose a new way of defining and studying operads on multigraphs and similar objects. For this purpose, we use the combinatorial species setting. We study in particular two operads obtained with our method. The former is a direct generalization o f the Kontsevich-Willwacher operad. This operad can be seen as a canonical operad on multigraphs, and has many interesting suboperads. The latter operad is a natural extension of the pre-Lie operad in a sense developed here and it is related to the multigraph operad. We also present various results on some of the finitely generated suboperads of the multigraph operad and establish links between them and the commutative operad and the commutative magmatic operad.
التعليقات
جاري جلب التعليقات جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا