Results 11 to 20 of about 110,665 (282)
Feynman graph polynomials [PDF]
International Journal of Modern Physics A, 2010 The integrand of any multi-loop integral is characterised after Feynman parametrisation by two polynomials. In this review we summarise the properties of these polynomials.
Belkale P. +22 more
core +2 more sources
Graph Operations and Neighborhood Polynomials
Discussiones Mathematicae Graph Theory, 2021 The neighborhood polynomial of graph G is the generating function for the number of vertex subsets of G of which the vertices have a common neighbor in G.
Alipour Maryam, Tittmann Peter
doaj +4 more sources
Graph polynomials and group coloring of graphs
European Journal of Combinatorics, 2022 Let $Γ$ be an Abelian group and let $G$ be a simple graph. We say that $G$ is $Γ$-colorable if for some fixed orientation of $G$ and every edge labeling $\ell:E(G)\rightarrow Γ$, there exists a vertex coloring $c$ by the elements of $Γ$ such that $c(y)-c(x)\neq \ell(e)$, for every edge $e=xy$ (oriented from $x$ to $y$).
Bosek, Bartlomiej +4 more
openaire +6 more sources
Omega, Sadhana, Theta, and PI Polynomials of Double Benzonoid Chain
Journal of Mathematics, 2022 Counting polynomials are closely related to certain features of chemical graphs and provide an elegant means of expressing graph topological invariants.
Fozia Bashir Farooq +3 more
doaj +1 more source
A novel method to construct cospectral graphs based on RT operation [PDF]
AIP AdvancesThis paper presents a new graph operation, RT(G), which is formed by transforming each vertex and edge of the original graph G into a triangle. We analyze the relationship between the signless Laplacian characteristic polynomials of the graph RT(G) and ...
Xiu-Jian Wang +2 more
doaj +1 more source
Counting the number of dissociation sets in cubic graphs
AIMS Mathematics, 2023 Let $ G $ be a graph. A dissociation set of $ G $ is a subset of vertices that induces a subgraph with vertex degree at most 1. The dissociation polynomial of $ G $ is $ D_{G}(\lambda) = \sum_{D \in \mathcal{D}(G)} \lambda^{|D|} $, where $ \mathcal{D}(G)
Jianhua Tu , Junyi Xiao, Rongling Lang
doaj +1 more source
Polytopes from Subgraph Statistics [PDF]
Discrete Mathematics & Theoretical Computer Science, 2011 We study polytopes that are convex hulls of vectors of subgraph densities. Many graph theoretical questions can be expressed in terms of these polytopes, and statisticians use them to understand exponential random graph models.
Alexander Engström, Patrik Norén
doaj +1 more source
Topological Graph Polynomials in Colored Group Field Theory [PDF]
, 2009 In this paper we analyze the open Feynman graphs of the Colored Group Field Theory introduced in [arXiv:0907.2582]. We define the boundary graph $\cG_{\partial}$ of an open graph $\cG$ and prove it is a cellular complex.
A. Connes +37 more
core +1 more source
The cycle (circuit) polynomial of a graph with double and triple weights of edges and cycles
Electronic Journal of Graph Theory and Applications, 2019 Farrell introduced the general class of graph polynomials which he called the family polynomials, or F-polynomials, of graphs. One of these is the cycle, or circuit, polynomial.
Vladimir R. Rosenfeld
doaj +1 more source
Graph-Counting Polynomials for Oriented Graphs [PDF]
Journal of Statistical Physics, 2018 6 ...
openaire +2 more sources