A simple graph \(G=(V(G),E(G))\) admits an \(H\)-covering if \(\forall \ e \in E(G)\ \Rightarrow\ e \in E(H’)\) for some \((H’ \cong H )\subseteq G\). A graph \(G\) with \(H\) covering is an \((a,d)\)-\(H\)-antimagic if for bijection \(f:V\cup E \to \{1,2,\dots, |V(G)|+|E(G)| \}\), the sum of labels of all the edges and vertices belong to \(H’\) constitute an arithmetic progression \(\{a, a+d, \dots, a+(t-1)d\}\), where \(t\) is the number of subgraphs \(H’\). For \(f(V)= \{ 1,2,3,\dots,|V(G)|\}\), the graph \(G\) is said to be super \((a,d)\)-\(H\)-antimagic and for \(d=0\) it is called  \(H\)-supermagic. In this paper, we investigate the existence of super \((a,d)\)-\(C_3\)-antimagic labeling of a corona graph, for differences \(d=0,1,\dots, 5\).

In this paper, we use the Delta Riemann-Liouville fractional integrals to establish some new integral inequalities for the Chebyshev functional in the case of two synchronous functions on time scales. Our results improve the inequalities for the discrete and continuous cases.

It is proved that if the problem \(\nabla^2u=1\) in \(D\), \(u|_S=0\), \(u_N=m:=|D|/|S|\) then \(D\) is a ball. There were at least two different proofs published of this result. The proof given in this paper is novel and short.

The application of graph theory in chemical and molecular structure research far exceeds people’s expectations, and it has recently grown exponentially. In the molecular graph, atoms are represented by vertices and bonded by edges. In this report, we study the M-polynomial of line graph of \(HAC_{5}C_{6}C_{7}[p,q]\) and recover many degree-based topological indices from it.

In this paper we aim to compute some Zagreb type polynomials of Möbius Ladder. Moreover we compute redefined Zagreb indices of Möbius Ladder.

The application of graph theory in chemical and molecular structure research far exceeds people’s expectations, and it has recently grown exponentially. In the molecular graph, atoms are represented by vertices and bonded by edges. In this report, we study the Zagreb-polynomials of line graph of \(HAC_{5}C_{6}C_{7}[p,q]\) and compute some degree-based topological indices from it.

Let \(k>0\) an integer. \(F\), \(\tau \), \(N\), \(N_{k}\), \(N_{k}^{(2)}\) and \(A\) denote the classes of finite, torsion, nilpotent, nilpotent of class at most \(k\), group which every two generator subgroup is \(N_{k}\) and abelian groups respectively. The main results of this paper is, firstly, we prove that, in the class of finitely generated \(\tau N\)-group (respectively \(FN\)-group) a \((FC)\tau \)-group (respectively \((FC)F\)-group) is a \(\tau A\)-group (respectively is \(FA\)-group). Secondly, we prove that a finitely generated \(\tau N\)-group (respectively \(FN\)-group) in the class \(((\tau N_{k})\tau ,\infty)\) (respectively \(((FN_{k})F,\infty)\)) is a \(\tau N_{k}^{(2)}\)-group (respectively \(FN_{k}^{(2)}\)-group). Thirdly we prove that a finitely generated \(\tau N\)-group ( respectively \(FN\)-group) in the class \(((\tau N_{k})\tau ,\infty)^{\ast}\) (respectively \(((FN_{k})F,\infty)^{\ast}\)) is a \(\tau N_{c}\)-group (respectively \(FN_{c}\)-group) for certain integer \(c\) and we extend this results to the class of \(NF\)-groups.

The generalized hierarchical product of graphs was introduced by L. Barrière et al. in 2009. In this paper, reformulated first Zagreb index of generalized hierarchical product of two connected graphs and hence as a special case cluster product of graphs are obtained. Finally using the derived results the reformulated first Zagreb index of some chemically important graphs such as square comb lattice, hexagonal chain, molecular graph of truncated cube, dimer fullerene, zig-zag polyhex nanotube and dicentric dendrimers are computed.

The atom-bond connectivity (ABC) index of a graph \(G=(V,E)\) is defined as \(ABC(G)=\sum_{v _{i}v_{j} \in E}\sqrt{(d_{i}+d_{j}-2)/(d_{i}d_{j})}\), where \(d_{i}\) denotes the degree of vertex \(v_{i}\) of \(G\). Due to its interesting applications in chemistry, this molecular structure descriptor has become one of the most actively studied vertex-degree-based graph invariants. Many efforts were made towards the elementary problem of characterizing tree(s) with minimal ABC index, which remains open and was coined as the ABC index conundrum”. Up to date, quite a few significant results have been obtained. In the course of research computer search plays a non-negligible role. In the present paper we review the state of the art of the problem. In addition we intend to demonstrate that, repeating the procedure “searching – conjecturing – proving” can be an applicable paradigm to cope with elusive problems of extremal graph characterization.

Let \(G\) be a simple, finite and connected graph. A graph is said to be decomposed into subgraphs \(H_1\) and \(H_2\) which is denoted by \(G= H_1 \oplus H_2\), if \(G\) is the edge disjoint union of \(H_1\) and \(H_2\). Assume that \(G= H_1 \oplus H_2 \oplus \cdots \oplus H_k\) and if each (H_i\), \(1 \leq i \leq k\), is a path or cycle in \(G\), then the collection of edge-disjoint subgraphs of \(G\) denoted by \(\psi\) is called a path decomposition of \(G\). If each \(H_i\) is a path in \(G\) then \(\psi\) is called an acyclic path decomposition of \(G\). The minimum cardinality of a path decomposition of \(G\), denoted by \(\pi (G)\), is called the path decomposition number and the minimum cardinality of an acyclic path decomposition of \(G\), denoted by \(\pi_a(G)\), is called the acyclic path decomposition number of \(G\). In this paper, we determine path decomposition number for a number of graphs in particular, the Cartesian product of graphs. We also provided bounds for \(\pi(G)\) and \(\pi_a(G)\) for these graphs.