Results 31 to 40 of about 110,665 (282)

A novel approach for the system of coupled differential equations using clique polynomials of graph

open access: yesPartial Differential Equations in Applied Mathematics, 2022
This study proposed an efficient numerical technique for coupled differential equations (CDEs) using the clique polynomials of the Complete graph. Recently, Graph theory has dragged the attention of many mathematicians due to its wide applications. Here,
Kumbinarasaiah S., Manohara G.
doaj   +1 more source

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

open access: yes, 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   +2 more
core   +3 more sources

Interlace polynomials of lollipop and tadpole graphs

open access: yesElectronic Journal of Graph Theory and Applications, 2022
In this paper, we examine interlace polynomials of lollipop andtadpole graphs. The lollipop and tadpole graphs are similar in that they bothinclude a path attached to a graph by a single vertex.
Christina L Eubanks-Turner   +2 more
doaj   +1 more source

Pattern polynomial graphs

open access: yesIndian Journal of Pure and Applied Mathematics, 2023
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

Relative Tutte polynomials of tensor products of colored graphs [PDF]

open access: yes, 2012
The tensor product $(G_1,G_2)$ of a graph $G_1$ and a pointed graph $G_2$ (containing one distinguished edge) is obtained by identifying each edge of $G_1$ with the distinguished edge of a separate copy of $G_2$, and then removing the identified edges. A
Brylawski, Chmutov, G. HETYEI, Y. DIAO
core   +1 more source

Interlace polynomials of friendship graphs

open access: yesElectronic Journal of Graph Theory and Applications, 2018
In this paper, we study the interlace polynomials of friendship graphs, that is, graphs that satisfy the Friendship Theorem given by Erdös, Rényi and Sos.
Christina Eubanks-Turner, Aihua Li
doaj   +1 more source

Vertex-weighted Wiener polynomials of subdivision-related graphs [PDF]

open access: yesOpuscula Mathematica, 2016
Singly and doubly vertex-weighted Wiener polynomials are generalizations of both vertex-weighted Wiener numbers and the ordinary Wiener polynomial. In this paper, we show how the vertex-weighted Wiener polynomials of a graph change with subdivision ...
Mahdieh Azari   +2 more
doaj   +1 more source

On Topological Indices of Total Graph and Its Line Graph for Kragujevac Tree Networks

open access: yesComplexity, 2021
Kragujevac tree is indicated by K; K∈Kgq=s2t+1+1,s with order and size s2t+1+1 and s2t+1, respectively. In this paper, we have a look at certain topological features of the total graph and line graph of the total graph of the considered tree, i.e ...
Salma Kanwal   +6 more
doaj   +1 more source

The Interlace Polynomial

open access: yes, 2016
In this paper, we survey results regarding the interlace polynomial of a graph, connections to such graph polynomials as the Martin and Tutte polynomials, and generalizations to the realms of isotropic systems and delta-matroids.Comment: 18 pages, 5 ...
Morse, Ada
core   +1 more source

Graph-polynomials

open access: yesAdvances in Applied Mathematics, 2004
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

Home - About - Disclaimer - Privacy