Results 1 to 10 of about 110,665 (282)
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 +3 more sources
Applications of magnesium iodide structure via modified-polynomials [PDF]
Scientific ReportsA relatively recent approach in molecular graph theory for analyzing chemical networks and structures is called a modified polynomial. It emphasizes the characteristics of molecules through the use of a polynomial-based procedure and presents numerical ...
Haleemah Ghazwani +4 more
doaj +2 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
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
Computing F-index, coindex and Zagreb polynomials of the kth generalized transformation graphs
Heliyon, 2020 In chemical graph theory, forgotten topological index or F-index plays a crucial role to collect information about the properties of chemical compounds. The kth generalized transformation graphs of a molecular graph preserve the entire information on the
Durbar Maji, Ganesh Ghorai
doaj +1 more source
Detour Hosoya Polynomials of Some Compound Graphs [PDF]
Al-Rafidain Journal of Computer Sciences and Mathematics, 2010 In this paper we will introduce a new graph distance based polynomial; Detour Hosoya polynomials of graphs . The Detour Hosoya polynomials for some special graphs such as paths and cycles are obtained.
Herish Abdullah, Gashaw Muhammed-Saleh
doaj +1 more source