the topological index of a graph g is a numeric quantity related to g which is invariant underautomorphisms of g. the vertex pi polynomial is defined as piv (g)  euv nu (e)  nv (e).then omega polynomial (g,x) for counting qoc strips in g is defined as (g,x) =cm(g,c)xc with m(g,c) being the number of strips of length c. in this paper, a new infiniteclass of fullerenes is constructed. the ...

a novel algorithm for the fast detection of hubs in chemical networks is presented. thealgorithm identifies a set of nodes in the network as most significant, aimed to be the mosteffective points of distribution for fast, widespread coverage throughout the system. we showthat our hubs have in general greater closeness centrality and betweenness centrality thanvertices with maximal degree, while...

‎recently‎, ‎some techniques such as adding whiskers and attaching graphs to vertices of a given graph‎, ‎have been proposed for constructing a new vertex decomposable graph‎. ‎in this paper‎, ‎we present a new method for constructing vertex decomposable graphs‎. ‎then we use this construction to generalize the result due to cook and nagel‎.

Let G be a simple graph with vertex set V(G) {v1,v2 ,...vn} . For every vertex i v , ( ) i  v represents the degree of vertex i v . The h-th order of Randić index, h R is defined as the sum of terms 1 2 1 1 ( ), ( )... ( ) i i ih  v  v  v  over all paths of length h contained (as sub graphs) in G . In this paper , some bounds for higher Randić index and a method for computing the higher R...

the first extended zeroth-order connectivity index of a graph   g is defined as 0 1/2 1 ( ) ( ) ,   v   v v g      g d      where   v   (g) is the vertex set of g, and v d is the sum of degrees of neighbors of vertex v in g. we give a sharp lower bound for the first extended zeroth-order connectivity index of trees with given numbers of vertices and pendant vertices,...

Let $G$ be a simple graph with vertex set $V$. A double Roman dominating function (DRDF) on $G$ is a function $f:Vrightarrow{0,1,2,3}$ satisfying that if $f(v)=0$, then the vertex $v$ must be adjacent to at least two vertices assigned $2$ or one vertex assigned $3$ under $f$, whereas if $f(v)=1$, then the vertex $v$ must be adjacent to at least one vertex assigned $2$ or $3$. The weight of a DR...

The notions of vertex Lie algebra and vertex Poisson algebra are presented and connections among vertex Lie algebras, vertex Poisson algebras and vertex algebras are discussed.