Results 11 to 20 of about 110,794 (282)

Graph polynomials derived from Tutte–Martin polynomials

Discrete Mathematics, 2005
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +3 more sources

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

Quantization of gauge fields, graph polynomials and graph cohomology [PDF]

, 2013
We review quantization of gauge fields using algebraic properties of 3-regular graphs. We derive the Feynman integrand at n loops for a non-abelian gauge theory quantized in a covariant gauge from scalar integrands for connected 3-regular graphs ...
Kreimer, Dirk, Sars, Matthias, van Suijlekom, Walter D.   +2 more
core   +5 more sources

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, Saima Parveen, Nadeem Ul Hassan Awan, Rakotondrajao Fanja   +3 more
doaj   +1 more source

A novel method to construct cospectral graphs based on RT operation [PDF]

AIP Advances
This 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, Xiao-Juan Tang, Jia-Bao Liu   +2 more
doaj   +1 more source

Polytopes from Subgraph Statistics [PDF]

Discrete Mathematics & Theoretical Computer Science, 2011
We study polytopes that are convex hulls of vectors of subgraph densities. Many graph theoretical questions can be expressed in terms of these polytopes, and statisticians use them to understand exponential random graph models.
Alexander Engström, Patrik Norén
doaj   +1 more source

Topological Graph Polynomials in Colored Group Field Theory [PDF]

, 2009
In this paper we analyze the open Feynman graphs of the Colored Group Field Theory introduced in [arXiv:0907.2582]. We define the boundary graph $\cG_{\partial}$ of an open graph $\cG$ and prove it is a cellular complex.
A. Connes, B. Bollobás, B. Bollobás, B. Bollobás, C. Itzykson, D. Boulatov, E.R. Livine, F. Conrady, F. David, G. Kirchhoff, G. ‘t Hooft, G. ’t Hooft, H. Grosse, H. Grosse, H. Grosse, H.H. Crapo, J. Engle, J. Engle, J.B. Geloun, L. Freidel, L. Freidel, L. Freidel, M. Disertori, M. Disertori, M. Gross, M.R. Douglas, N. Nakanishi, N. Sasakura, R. De Pietri, R. Gurau, R. Gurau, R. Gurau, R. Gurau, Razvan Gurau, V. Bonzom, V. Rivasseau, V. Rivasseau, W.T. Tutte   +37 more
core   +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

Graph-Counting Polynomials for Oriented Graphs [PDF]

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

Computing Wiener and Hyper-Wiener Indices of Zero-Divisor Graph of ℤℊ3×ℤI1I2

Journal of Function Spaces, 2022
Let S=ℤℊ3×ℤI1I2 be a commutative ring where ℊ,I1 and I2 are positive prime integers with I1≠I2. The zero-divisor graph assigned to S is an undirected graph, denoted as YS with vertex set V(Y(S)) consisting of all Zero-divisor of the ring S and for any c,
Yonghong Liu, Abdul Rauf, null AdnanAslam, Saira Ishaq, Abudulai Issa   +4 more
doaj   +1 more source