6 citations · 9 across the 4 of their papers we have counts for
4 papers
Some Preliminary Result About the Inset Edge and Average Distance of Trees
M. H. Khalifeh, A. -H. Esfahanian
An added edge to a graph is called an inset edge. Predicting k inset edges which minimize the average distance of a graph is known to be NP-Hard. However, when k = 1 the complexity…
Inset Edges Effect and Average Distance of Trees
M. H. Khalifeh, A. -H. Esfahanian
An added edge to a graph is called an inset edge. Predicting k inset edges which minimize the average distance of a graph is known to be NP-Hard. When k = 1 the complexity of the p…
Distance preserving graphs and graph products
M. H. Khalifeh, Bruce E. Sagan, Emad Zahedi
If is a graph then a subgraph is if, for every pair of vertices of , we have where is the distance function. We say a graph $…
The hyper Wiener index of one pentagonal carbon nanocone
M. H. Khalifeh, M. R. Darafsheh, Hassan Jolany
The aim of this paper is the computing one of topological indices of One-pentagonal carbon Nanocone. One-pentagonal carbon nanocone consists of one pentagone as its core surrounded…