Results 31 to 40 of about 7,067 (209)
Interlace polynomials of lollipop and tadpole graphs
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
Topological invariants for the line graphs of some classes of graphs
Graph theory plays important roles in the fields of electronic and electrical engineering. For example, it is critical in signal processing, networking, communication theory, and many other important topics.
Zhou Xiaoqing +5 more
doaj +1 more source
Vertex-weighted Wiener polynomials of subdivision-related graphs [PDF]
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
Interlace polynomials of friendship graphs
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
On Topological Indices of Total Graph and Its Line Graph for Kragujevac Tree Networks
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 μ-polynomials of graph associahedra. [PDF]
We study two polynomials associated to a graph G that are of interest in the recent literature. The first one is the h-polynomial of the graph-associahedron of G defined by Carr and Devadoss.
Ávila Ramírez, Nicolás
core
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Polynomial hulls of graphs [PDF]
We consider the polynomially convex hull of the graph of a continuous complex-valued function on the boundary of the unit ball. We show first that the hull covers the closed unit ball and then consider several of its properties. In particular, when is the hull also a graph; i.e. single sheeted?
openaire +3 more sources
The equivalence of two graph polynomials and a symmetric function
The U-polynomial, the polychromate and the symmetric function generalization of the Tutte polynomial due to Stanley are known to be equivalent in the sense that the coefficients of any one of them can be obtained as a function of the coefficients of any ...
Noble, SD +5 more
core +1 more source
Introduction to Graph Polynomials [PDF]
With graph polynomials being a fairly new but intricate realm of graph theory, I will begin with a brief historical background and progress to elucidate each polynomial’s unique characteristics and mathematical underpinnings.
Hamilton, Shanee' +1 more
core

