Results 1 to 10 of about 4,642 (166)
Graph polynomials and paintability of plane graphs
Discrete Applied Mathematics, 2022 There exists a variety of coloring problems for plane graphs, involving vertices, edges, and faces in all possible combinations. For instance, in the \emph{entire coloring} of a plane graph we are to color these three sets so that any pair of adjacent or incident elements get different colors.
Jarosław Grytczuk +2 more
exaly +3 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
Connection between Graphs' Chromatic and Ehrhart Polynomials [PDF]
Journal of Applied Sciences and Nanotechnology, 2023 Graph Theory is a discipline of mathematics with numerous outstanding issues and applications in a variety of sectors of mathematics and science. The chromatic polynomial is a type of polynomial that has useful and attractive qualities.
Ola Neamah, Shatha Salman
doaj +1 more source
Graph polynomials associated with Dyson-Schwinger equations [PDF]
Mathematica Moravica, 2023 Quantum motions are encoded by a particular family of recursive Hochschild equations in the renormalization Hopf algebra which represent Dyson-Schwinger equations, combinatorially.
Shojaei-Fard Ali
doaj +1 more source
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$).
Bartlomiej Bosek +4 more
openaire +6 more sources
A study on determination of some graphs by Laplacian and signless Laplacian permanental polynomials
AKCE International Journal of Graphs and Combinatorics, 2023 The permanent of an n × n matrix [Formula: see text] is defined as [Formula: see text] where the sum is taken over all permutations σ of [Formula: see text] The permanental polynomial of M, denoted by [Formula: see text] is [Formula: see text] where In ...
Aqib Khan +2 more
doaj +1 more source
Indonesian Journal of Combinatorics, 2020 Dutch windmill graph [1, 2] and denoted by Dnm. Order and size of Dutch windmill graph are (n−1)m+1 and mn respectively. In this paper, we computed certain topological indices and polynomials i.e.
Salma Kanwal +4 more
doaj +1 more source
Location of zeros of Wiener and distance polynomials. [PDF]
PLoS ONE, 2012 The geometry of polynomials explores geometrical relationships between the zeros and the coefficients of a polynomial. A classical problem in this theory is to locate the zeros of a given polynomial by determining disks in the complex plane in which all ...
Matthias Dehmer, Aleksandar Ilić
doaj +1 more source
Computation of Zagreb Polynomial and Indices for Silicate Network and Silicate Chain Network
Journal of Mathematics, 2023 The connection of Zagreb polynomials and Zagreb indices to chemical graph theory is a bifurcation of mathematical chemistry, which has had a crucial influence on the development of chemical sciences.
Muhammad Usman Ghani +4 more
doaj +1 more source
FEYNMAN GRAPH POLYNOMIALS [PDF]
International Journal of Modern Physics A, 2010 The integrand of any multiloop integral is characterized after Feynman parametrization by two polynomials. In this review we summarize the properties of these polynomials. Topics covered in this paper include among others: spanning trees and spanning forests, the all-minors matrix-tree theorem, recursion relations due to contraction and deletion of ...
Bogner, Christian, Weinzierl, Stefan
openaire +2 more sources