Let G be a simple connected graph. The distance between the edges g and f ∈ E(G) is defined as the distance between the corresponding vertices g and f in the line graph of G. The edge-Wiener index of G is defined as the sum of such distances between all pairs of edges of the graph. Let G 1 +G 2 and G 1 •G 2 be the join and the corona of graphs G 1 and G 2 , respectively. In this paper, we present explicit formulas for the edge-Wiener index for these graphs. Then we apply our results to compute the edge-Wiener index of suspensions, bottlenecks, and thorny graphs.
For a simple connected graph [Formula: see text], the reciprocal transmission [Formula: see text] of a vertex [Formula: see text] is defined as [Formula: see text] The reciprocal distance signless Laplacian (briefly RDSL) matrix of a connected graph [Formula: see text] is defined as [Formula: see text], where [Formula: see text] is the Harary matrix (reciprocal distance matrix) of [Formula: see text] and [Formula: see text] is the diagonal matrix of the vertex reciprocal transmissions in [Formula: see text]. In this paper, we first investigate the RDSL spectrum of the join and also joined union of graphs and we construct new pairs of equienergetic graphs by using the joined union of regular graphs. Then we obtain some bounds on the spectral radius of reciprocal distance signless Laplacian matrix of [Formula: see text], which is the largest eigenvalue of the matrix [Formula: see text]. We also characterize the extremal graphs.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.