RESUMO
Let G be a graph on n vertices with vertex set V(G) and let SâV(G) with |S|=α. Denote by GS, the graph obtained from G by adding a self-loop at each of the vertices in S. In this note, we first give an upper bound and a lower bound for the energy of GS (E(GS)) in terms of ordinary energy (E(G)), order (n) and number of self-loops (α). Recently, it is proved that for a bipartite graph GS, E(GS)≥E(G). Here we show that this inequality is strict for an unbalanced bipartite graph GS with 0<α
RESUMO
Graph entropy plays an essential role in interpreting the structural information and complexity measure of a network. Let G be a graph of order n. Suppose dG(vi) is degree of the vertex vi for each i=1,2, ,n. Now, the k-th degree-based graph entropy for G is defined as Id,k(G)=-∑i=1ndG(vi)k∑j=1ndG(vj)klogdG(vi)k∑j=1ndG(vj)k, where k is real number. The first-degree-based entropy is generated for k=1, which has been well nurtured in last few years. As ∑j=1ndG(vj)k yields the well-known graph invariant first Zagreb index, the Id,k for k=2 is worthy of investigation. We call this graph entropy as the second-degree-based entropy. The present work aims to investigate the role of Id,2 in structure property modeling of molecules.
RESUMO
Given a connected graph H, its reciprocal degree distance is defined asRDD(H)=∑x≠ydH(vx)+dH(vy)dH(vx,vy), where dH(vx) denotes the degree of the vertex vx in the graph H and dH(vx,vy) is the shortest distance between vx and vy in H. The goal of this paper is to establish some sufficient conditions to judge that a graph to be h-hamiltonian, h-path-coverable or h-edge-hamiltonian by employing the reciprocal degree distance.
RESUMO
Let [Formula: see text] be a simple graph. The resistance distance between [Formula: see text], denoted by [Formula: see text], is defined as the net effective resistance between nodes i and j in the corresponding electrical network constructed from G by replacing each edge of G with a resistor of 1 Ohm. The resistance-distance matrix of G, denoted by [Formula: see text], is a [Formula: see text] matrix whose diagonal entries are 0 and for [Formula: see text], whose ij-entry is [Formula: see text]. In this paper, we determine the eigenvalues of the resistance-distance matrix of complete multipartite graphs. Also, we give some lower and upper bounds on the largest eigenvalue of the resistance-distance matrix of complete multipartite graphs. Moreover, we obtain a lower bound on the second largest eigenvalue of the resistance-distance matrix of complete multipartite graphs.