Results 41 to 50 of about 4,659 (167)
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
On the Degeneracy of the Orbit Polynomial and Related Graph Polynomials
Symmetry, 2020 The orbit polynomial is a new graph counting polynomial which is defined as OG(x)=∑i=1rx|Oi|, where O1, …, Or are all vertex orbits of the graph G. In this article, we investigate the structural properties of the automorphism group of a graph by using several novel counting polynomials.
Modjtaba Ghorbani +2 more
openaire +3 more sources
Polynomial graph transformability
Theoretical Computer Science, 2012 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hans-Jörg Kreowski, Sabine Kuske
openaire +1 more source
Explicit formulas for chromatic polynomials of some series-parallel graphs
Учёные записки Казанского университета: Серия Физико-математические науки, 2018 The main goal of our paper is to present explicit formulas for chromatic polynomials of some planar series-parallel graphs (sp-graphs). The necklace-graph considered in this paper is the simplest non-trivial sp-graph.
E.Yu. Lerner, S.A. Mukhamedjanova
doaj
On a class of polynomials associated with the Cliques in a graph and its applications
International Journal of Mathematics and Mathematical Sciences, 1989 The clique polynomial of a graph is defined. An explicit formula is then derived for the clique polynomial of the complete graph. A fundamental theorem and a reduction process is then given for clique polynomials.
E. J. Farrell
doaj +1 more source
Entropy and Multi-Fractal Analysis in Complex Fractal Systems Using Graph Theory
Axioms, 2023 In 1997, Sierpinski graphs, S(n,k), were obtained by Klavzar and Milutinovic. The graph S(1,k) represents the complete graph Kk and S(n,3) is known as the graph of the Tower of Hanoi. Through generalizing the notion of a Sierpinski graph, a graph named a
Zeeshan Saleem Mufti +3 more
doaj +1 more source
Graph characterising polynomials
Discrete Mathematics, 1999 A graph invariant is a function \(f\) from the class of all graphs into a commutative ring \(R\) such that \(f\) takes the same value on isomorphic graphs. If \(R\) is a ring of polynomials in one or more variables, the invariant \(f\) is called an invariant polynomial for graphs. If \(f\) satisfies the converse condition that \(f(G)=f(H)\) implies \(G\
openaire +2 more sources
Fuzzy Chromatic Polynomial of Fuzzy Graphs with Crisp and Fuzzy Vertices Using α-Cuts
Advances in Fuzzy Systems, 2019 Coloring of fuzzy graphs has many real life applications in combinatorial optimization problems like traffic light system, exam scheduling, register allocation, etc.
Mamo Abebe Ashebo +1 more
doaj +1 more source
Problems on chromatic polynomials of hypergraphs
Electronic Journal of Graph Theory and Applications, 2020 Chromatic polynomials of graphs have been studied extensively for around one century. The concept of chromatic polynomial of a hypergraph is a natural extension of chromatic polynomial of a graph. It also has been studied for more than 30 years.
Ruixue Zhang, Fengming Dong
doaj +1 more source
Further study of eccentricity based indices for benzenoid hourglass network
Heliyon, 2023 Topological Indices are the mathematical estimate related to atomic graph that corresponds biological structure with several real properties and chemical activities. These indices are invariant of graph under graph isomorphism.
Hifza Iqbal +6 more
doaj +1 more source