Results 61 to 70 of about 7,067 (209)

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

Extremal Bicyclic Graphs with Respect to Permanental Sums and Hosoya Indices

Axioms
Graph polynomials is one of the important research directions in mathematical chemistry. The coefficients of some graph polynomials, such as matching polynomial and permanental polynomial, are related to structural properties of graphs.
Tingzeng Wu, Yinggang Bai, Shoujun Xu
doaj   +1 more source

Structural differentiation of graphs using Hosoya-based indices. [PDF]

PLoS ONE, 2014
In this paper, we introduce the Hosoya-Spectral indices and the Hosoya information content of a graph. The first measure combines structural information captured by partial Hosoya polynomials and graph spectra. The latter is a graph entropy measure which
Matthias Dehmer, Abbe Mowshowitz, Yongtang Shi   +2 more
doaj   +1 more source

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

Homomorphisms and polynomial invariants of graphs

European Journal of Combinatorics, 2007
Junta de Andalucía P06-FQM ...
Delia Garijo, Jaroslav Nesetril, M. P. Revuelta   +2 more
openaire   +5 more sources

Entropy due to Fragmentation of Dendrimers [PDF]

Surveys in Mathematics and its Applications, 2009
Subgraphs can results through application of criteria based on matrix which characterize the entire graph. The most important categories of criteria are the ones able to produce connected subgraphs (fragments). Based on theoretical frame on graph theory,
Sorana D. Bolboacă, Lorentz Jäntschi
doaj  

Matchings in hexagonal cacti

International Journal of Mathematics and Mathematical Sciences, 1987
Explicit recurrences are derived for the matching polynomials of the basic types of hexagonal cacti, the linear cactus and the star cactus and also for an associated graph, called the hexagonal crown.
E. J. Farrell
doaj   +1 more source

Chromatic Schultz and Gutman Polynomials of Jahangir Graphs J2,m and J3,m

Journal of Applied Mathematics, 2023
Topological polynomial and indices based on the distance between the vertices of a connected graph are widely used in the chemistry to establish relation between the structure and the properties of molecules.
Ramy Shaheen, Suhail Mahfud, Qays Alhawat   +2 more
doaj   +1 more source

Graph-Counting Polynomials for Oriented Graphs [PDF]

Journal of Statistical Physics, 2018
6 ...
openaire   +2 more sources

Note on the smallest root of the independence polynomial

, 2013
One can define the independence polynomial of a graph G as follows. Let i(k)(G) denote the number of independent sets of size k of G, where i(0)(G) = 1. Then the independence polynomial of G is I(G,x) = Sigma(n)(k=0)(-1)(k)i(k)(G)x(k).
Csíkvári, Péter
core   +1 more source