edge distance-balanced graphs are graphs in which for every edge $e = uv$ the number of edges closer to vertex $u$ than to vertex $v$ is equal to the number of edges closer to $v$ than to $u$. in this paper, we study this property under some graph operations.

the emph{harary index} $h(g)$ of a connected graph $g$ is defined as $h(g)=sum_{u,vin v(g)}frac{1}{d_g(u,v)}$ where $d_g(u,v)$ is the distance between vertices $u$ and $v$ of $g$. the steiner distance in a graph, introduced by chartrand et al. in 1989, is a natural generalization of the concept of classical graph distance. for a connected graph $g$ of order at least $2$ and $ssubseteq v(g)$, th...

dna barcoding based on a standardized region of 648 base pairs of mitochondrial dnasequences from cytochrome c oxidase 1 (cox1) is proposed for animal species identification.recent studies suggested that dna barcoding has been effective for identifying 94% of birdspecies. the proposed threshold of 10 times the average intraspecific variation could be used forthe identification and delimitation ...

distance-balanced graphs are introduced as graphs in which every edge uv has the followingproperty: the number of vertices closer to u than to v is equal to the number of vertices closerto v than to u. basic properties of these graphs are obtained. in this paper, we study theconditions under which some graph operations produce a distance-balanced graph.

fullerenes are closed−cage carbon molecules formed by 12 pentagonal and n/2 – 10hexagonal faces, where n is the number of carbon atoms. patrick fowler in his lecture inmcc 2009 asked about the wiener index of fullerenes in general. in this paper werespond partially to this question for an infinite class of fullerenes with exactly 10ncarbon atoms. our method is general and can be applied to full...

Distance-balanced graphs are introduced as graphs in which every edge uv has the following property: the number of vertices closer to u than to v is equal to the number of vertices closer to v than to u. Basic properties of these graphs are obtained. In this paper, we study the conditions under which some graph operations produce a distance-balanced graph.