D^d DISTANCE ENERGY OF GRAPHS

For two vertices and of a graph , the usual distance , is the length of the shortest path between vertices and .In this paper, we introduce a new concept named Distance energy by considering the degrees of various vertices presented in the path, in addition to the length of the path for and zero otherwise.Also, we compute the Distance energy of some standard graphs.

Authors

Publication Details

Published
2024-08-31
DOI
https://doi.org/10.71058/jodac.v8i10018
Primary Topic
Graph Theory and Algorithms
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

D^d DISTANCE ENERGY OF GRAPHS

D. M., V Vinisha.
Graph Theory and Algorithms
article

D^d DISTANCE ENERGY OF GRAPHS

D. M., V Vinisha.
article en

Abstract

For two vertices and of a graph , the usual distance , is the length of the shortest path between vertices and .In this paper, we introduce a new concept named Distance energy by considering the degrees of various vertices presented in the path, in addition to the length of the path for and zero otherwise.Also, we compute the Distance energy of some standard graphs.

Affordable and clean energy
Openalex Percentile: Top 76%
Graph Theory and Algorithms
DOIOpen Access PDFOpenAlex
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

D^d DISTANCE ENERGY OF GRAPHS — D. M., V Vinisha. · (2024) | TGRS Research Map | TGRS