Results 11 to 20 of about 4,659 (167)
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
The Neighborhood Polynomial of Chordal Graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2021 We study the neighborhood polynomial and the complexity of its computation for chordal graphs. The neighborhood polynomial of a graph is the generating function of subsets of its vertices that have a common neighbor. We introduce a parameter for chordal graphs called anchor width and an algorithm to compute the neighborhood polynomial which runs in ...
Helena Bergold +2 more
openaire +4 more sources
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
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
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
The interlace polynomial of a graph
Journal of Combinatorial Theory, Series B, 2004 To appear in J.
Richard Arratia +2 more
openaire +2 more sources
Dichotomy Theorems for Homomorphism Polynomials of Graph Classes
Journal of Graph Algorithms and Applications, 2016 In this paper, we will show dichotomy theorems for the computation of polynomials corresponding to evaluation of graph homomorphisms in Valiant's model. We are given a fixed graph H and want to find all graphs, from some graph class, homomorphic
Christian Engels
doaj +1 more source
Discrete Applied Mathematics, 1992 For directed graphs \(G=(V_ G,E_ G)\) and \(H=(V_ H,E_ H)\) an \(H\)- coloring of \(G\) is a mapping \(f:V_ G\to V_ H\) such that for all edges \((u,v)\in E_ G\) we have \((f(u),f(v))\in E_ H\). The authors introduce a new technique for proving that the \(H\)-coloring problem is polynomially solvable for some fixed digraphs \(H\).
Gutjahr, W., Welzl, E., Woeginger, G.J.
openaire +2 more sources
Evaluations of Graph Polynomials [PDF]
, 2008 A graph polynomial $p(G, \bar{X})$ can code numeric information about the underlying graph G in various ways: as its degree, as one of its specific coefficients or as evaluations at specific points $\bar{X}= \bar{x}_0$. In this paper we study the question how to prove that a given graph parameter, say *** (G ), the size of the maximal clique of G ...
Benny Godlin +2 more
openaire +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