Abstract: In this paper, we obtain the bounds for the Laplacian eigenvalues of a weighted graph using traces. Then, we find the bounds for the Kirchhoff and Laplacian Estrada indices of a weighted graph. Finally, we define the Laplacian energy of a weighted graph and get the upper bound for this energy.

Abstract: A number of results on claw-free, paw-free graphs have been presented in the literature. Although the proofs of such results are elegant, sound and valid, it has gone unnoticed that all the results about claw-free, paw-free graphs in the literature are a consequence of a result by Olariu [1]. The note, apart from covering the aforementioned gap, also provides an alternate proof to a result by Faudree and Gould found in [2] in that, an unnoticed consequence resulted in the characterization of claw-free, paw-free graphs.

Abstract: A graph \(G\) is said to be super edge-magic if there exists a bijective function \(f:V\left(G\right) \cup E\left(G\right)\rightarrow \left\{1, 2, \ldots , \left\vert V\left( G\right) \right\vert +\left\vert E\left( G\right) \right\vert \right\}\) such that \(f\left(V \left(G\right)\right) =\left\{1, 2, \ldots , \left\vert V\left( G\right) \right\vert \right\}\) and \(f\left(u\right) + f\left(v\right) + f\left(uv\right)\) is a constant for each \(uv\in E\left( G\right)\). In this paper, we study the super edge-magicness of graphs of order \(n\) with degree sequence \(s:4, 2, 2, \ldots, 2\). We also investigate the super edge-magic properties of certain families of graphs. This leads us to propose some open problems.

Abstract: Coronoids are nice chemical structures that may be represented mathematically in the planar hexagonal lattice. They have been well-studied both for their chemical properties and also their enumerative aspects. Typical approaches to the latter type of questions often include classification and algorithmic techniques. Here we study one simple class of coronoids called hollow hexagons. Notably, hollow hexagons may be represented with a collection of partitions on the set \(\{2,3,4,6\}\). The hollow hexagons are used to classify another family of primitive coronoids, which we introduce here, called lattice path coronoids. Techniques from lattice path enumeration are used to count these newly-defined structures within equivalence classes indexed by enclosing hollow hexagons.