Results 41 to 50 of about 110,794 (282)
Tutte polynomials for directed graphs
Journal of Combinatorial Theory, Series B, 2020 The Tutte polynomial is a fundamental invariant of graphs. In this article, we define and study a generalization of the Tutte polynomial for directed graphs, that we name B-polynomial. The B-polynomial has three variables, but when specialized to the case of graphs (that is, digraphs where arcs come in pairs with opposite directions), one of the ...
Awan, Jordan, Bernardi, Olivier
openaire +4 more sources
From the Ising and Potts models to the general graph homomorphism polynomial
, 2015 In this note we study some of the properties of the generating polynomial for homomorphisms from a graph to at complete weighted graph on $q$ vertices.
Markström, Klas
core +1 more source
The construction of graphs with irreducible matching polynomials and their generalizations
AKCE International Journal of Graphs and CombinatoricsThis paper investigates methods for constructing graphs whose matching polynomials are irreducible over [Formula: see text]. Building on this, the construction method is extended to general graph polynomials, for graphs whose polynomials satisfy certain ...
Hou Shengzhe
doaj +1 more source
On Weakly Distinguishing Graph Polynomials [PDF]
Discrete Mathematics & Theoretical Computer Science, 2019 A univariate graph polynomial P(G;X) is weakly distinguishing if for almost all finite graphs G there is a finite graph H with P(G;X)=P(H;X). We show that the clique polynomial and the independence polynomial are weakly distinguishing.
Johann A. Makowsky, Vsevolod Rakita
doaj +1 more source
LLT polynomials, chromatic quasisymmetric functions and graphs with cycles
, 2017 We use a Dyck path model for unit-interval graphs to study the chromatic quasisymmetric functions introduced by Shareshian and Wachs, as well as vertical strip --- in particular, unicellular LLT polynomials.
Alexandersson, Per, Panova, Greta
core +1 more source
Polynomial graph transformability
Theoretical Computer Science, 2012 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kreowski, Hans-Jörg, Kuske, Sabine
openaire +1 more source
Relationship Between Neurologic Symptoms and Signs and FMR1 Genotype in Premutation Carriers
Annals of Clinical and Translational Neurology, EarlyView.ABSTRACT Background and Objectives Fragile X‐associated Tremor/Ataxia Syndrome (FXTAS) is the most severe late‐onset condition caused by a premutation in the FMR1 gene, characterized by expanded CGG triplet repeats of 55–200. Clinical presentations of FXTAS, including gait ataxia, kinetic tremor, cognitive decline, and rare Parkinsonism, are linked to ...
Flora Tassone +8 more
wiley +1 more source
On the graceful polynomials of a graph [PDF]
, 2019 Every graph can be associated with a family of homogeneous polynomials, one for every degree, having as many variables as the number of vertices. These polynomials are related to graceful labellings: a graceful polynomial with all even coefficients is a
Andrea Vietri
core
Properties of Feynman graph polynomials
, 2010 In this talk I discuss properties of the two Symanzik polynomials which characterise the integrand of an arbitrary multi-loop integral in its Feynman parametric form.
Belkale +28 more
core +1 more source
Discrete Applied Mathematics, 1992 For directed graphs \(G=(V_ G,E_ G)\) and \(H=(V_ H,E_ H)\) an \(H\)- coloring of \(G\) is a mapping \(f:V_ G\to V_ H\) such that for all edges \((u,v)\in E_ G\) we have \((f(u),f(v))\in E_ H\). The authors introduce a new technique for proving that the \(H\)-coloring problem is polynomially solvable for some fixed digraphs \(H\).
Gutjahr, W., Welzl, E., Woeginger, G.J.
openaire +2 more sources