Abstract:An edge irregular \(k\)-labeling of a graph \(G\) is a labeling of vertices of \(G\) with labels from the set \(\{1,2,3,\dots,k\}\) such that no two edges of \(G\) have same weight. The least value of \(k\) for which a graph \(G\) has an edge irregular \(k\)-labeling is called the edge irregularity strength of \(G\). Ahmad et. al. [1] showed the edge irregularity strength of some particular classes of Toeplitz graphs. In this paper we generalize those results and finds the exact values of the edge irregularity strength for some generalize classes of Toeplitz graphs.

Abstract:This note presents some upper bounds for the size of the upper deg-centric grapg \(G_{ud}\) of a simple connected graph G. Amongst others, a result for graphs for which a compliant graph \(G\) has \(G_{ud} \cong \overline G\) is presented. Finally, results for size minimality in respect upper deg-centrication and minimum size of such graph \(G\) are presented.

Abstract:Let \(G = (V(G), E(G))\) be a graph with minimum degree at least \(1\). The inverse degree of \(G\), denoted \(Id(G)\), is defined as the sum of the reciprocals of degrees of all vertices in \(G\). In this note, we present inverse degree conditions for Hamiltonian and traceable graphs.