In this paper we give various relations between the energy of graphs and other graph parameters as Randić index, clique number, number vertices edges, maximum minimum degree etc. Moreover, new bounds for complementary are derived. Our results based on concept vertex developed by G. Arizmendi O. in [Lin. Algebra Appl. doi:10.1016/j.laa.2020.09.025].

A T -gain graph, ? = ( G , ? ) is a graph in which the function assigns unit complex number to each orientation of an edge and its inverse assigned opposite orientation. The associated adjacency matrix defined canonically. energy E sum absolute values all eigenvalues . We study notion vertex establish bounds for it. For any ?, we prove that 2 ? ? c ? ? where are cover number, odd cycles largest...

The test system for emulsion pump is facing serious challenges due to its huge energy consumption and waste nowadays. To settle this energy issue, a novel energy regenerative system (ERS) for emulsion pump tests is briefly introduced at first. Modeling such an ERS of multienergy domains needs a unified and systematic approach. Bond graph modeling is well suited for this task. The bond graph mod...

Development of energy efficient Wireless Sensor Network (WSN) routing protocol is nowadays main area of interest amongst researchers. This research is an effort in designing energy efficient Wireless Sensor Network (WSN) routing protocol under certain parameters consideration. Research report discusses various existing WSN routing protocols and propose a new WSN energy efficient routing protoco...

For a finite group G, let Z(G) be the centre of G. Then non-commuting graph on denoted by ΓG, has G\Z(G) as its vertex set with two distinct vertices vp and vq joined an edge whenever vpvq ≠ vqvp. The degree sum matrix is square whose (p,q)-th entry dvp + dvq p different from q, otherwise, it zero, where dvi vi. This study presents general formula for energy, EDS (ΓG), dihedral groups order 2n,...