A graph labeling is an assignment of integers to the vertices or edges, or both, subject to
certain conditions. Graph labelings were first introduced in the mid 1960s. In the intervening …

A strong edge coloring of a graph G is an assignment of colors to the edges of G such that
two distinct edges are colored differently if they are adjacent to a common edge or share an …

A uniformly-ordered ρ-labeling (also known as a ρ++-labeling) of a bipartite graph was
introduced by El-Zanati, Vanden Eynden, and Punnim. Such a labeling of a bipartite graph G …

It is known that an ordered ρ-labeling (also known as a ρ+-labeling) of a bipartite graph G of
size m can be used to obtain a cyclic G-decomposition of K2mt+ 1 for every positive integer t …

Research on the topological indices based on eccentricity of vertices of a molecular graph
has been intensively rising recently. The eccentric connectivity index and the connective …

We prove that the generalized Petersen graph P8n, 3 admits an α-labeling for any integer
n⩾ 1 confirming that the conjecture posed by A. Vietri in [Vietri, A., Graceful labellings for an …

References Page 1 ATTIVIT`A DI RICERCA Il mio settore di ricerca `e l’ALGEBRA (Mat02). La
mia ricerca si svolge prevalentemente nell’ambito della teoria dei quasianelli (nearrings) …