MyPrints@UOM (Mysore University Library) · 2011 · 12 citations · 8 references
ComputingComputer ScienceComputational GeometryGraph AlgorithmsGraph TheoryComputational Complexity Of Graph AlgorithmsUpper Bound Computation
We introduce the concept of common–neighborhood energy \nECN of a graph G and obtain an upper bound for ECN when G is strongly regular. We also show that ECN of several classes of graphs is less than the common–neighborhood energy of the complete graph Kn
8
Linear Algebra and its Applications · 2004 · 700 citations
Jack H. Koolen, Vincent Moulton · Advances in Applied Mathematics · 2001 · 238 citations