Let $A$ and $B$ be two disjoint subsets of the vertex set $V$ of a graph $G$. The set $A$ is said to dominate $B$, denoted by $A rightarrow B$, if for every vertex $u in B$ there exists a vertex $v in A$ such that $uv in E(G)$. For any graph $G$, a partition $pi = {V_1,$ $V_2,$ $ldots,$ $V_p}$ of the vertex set $V$ is an textit{upper domatic partition} if $V_i rightarrow V_j$ or $V_j rightarrow...

In this paper, the dynamic analysis of the composite sandwich truncated conical shells (STCS) with various boundary conditions subjected to the low velocity impact was studied analytically, based on the higher order sandwich panel theory. The impact was assumed to occur normally over the top face-sheet, and the contact force history was predicted using two solution models of the motion which we...

We report recent results from the ALICE experiment the Large Hadron Collider on open charmed hadron production in pp collisions at ? s “ 2.76 and 7 TeV, and Pb–Pb collisions at sNN “ 2.76 TeV. Open charmed hadrons are kinematically fully reconstructed in the hadronic decay channels D0 Ñ K ́π`, D` Ñ K ́π`π`, and D ̊`p2010q Ñ D0π`and identified through their invariant mass. Combinatorial background ...

The second Zagreb coindex is a well-known graph invariant defined as the total degree product of all non-adjacent vertex pairs in a graph. The second Zagreb eccentricity coindex is defined analogously to the second Zagreb coindex by replacing the vertex degrees with the vertex eccentricities. In this paper, we present exact expressions or sharp lower bounds for the second Zagreb eccentricity co...

The notion of graph covers is a discretization covering spaces introduced and deeply studied in topology. In discrete mathematics theoretical computer science, they have attained lot attention from both the structural complexity perspectives. Nonetheless, disconnected graphs were usually omitted considerations with explanation that it sufficient to understand coverings connected components targ...

the rings considered in this article are  commutative  with identity which admit at least two  nonzero annihilating ideals. let $r$ be a ring. let $mathbb{a}(r)$ denote the set of all annihilating ideals of $r$ and let $mathbb{a}(r)^{*} = mathbb{a}(r)backslash {(0)}$. the annihilating-ideal graph of $r$, denoted by $mathbb{ag}(r)$  is an undirected simple graph whose vertex set is $mathbb{a}(r)...

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...