M. Faghani

[ 1 ] - A note on the bounds of Laplacian-energy-like-invariant

The Laplacian-energy-like of a simple connected graph G is defined as LEL:=LEL(G)=∑_(i=1)^n√(μ_i ), Where μ_1 (G)≥μ_2 (G)≥⋯≥μ_n (G)=0 are the Laplacian eigenvalues of the graph G. Some upper and lower bounds for LEL are presented in this note. Moreover, throughout this work, some results related to lower bound of spectral radius of graph are obtained using the term of ΔG as the num...

[ 2 ] - New Expansion for Certain Isomers of Various Classes of Fullerenes

This paper is dedicated to propose an algorithm in order to generate the certain isomers of some well-known fullerene bases. Furthermore, we enlist the bipartite edge frustration correlated with some of symmetrically distinct innite families of fullerenes generated by the oered process.

[ 3 ] - On the Maximum Number of Dominating Classes in Graph Coloring

In this paper we investigate the dominating- -color number، of a graph G. That is the maximum number of color classes that are also dominating when G is colored using colors. We show that where is the join of G and H. This result allows us to construct classes of graphs such that and thus provide some information regarding two questions raised in [1] and [2].