Harary index of bipartite graphs

Harary index of bipartite graphs

<p>Let <span class="math"><em>G</em></span> be a connected graph with vertex set <span class="math"><em>V</em>(<em>G</em>)</span>. The Harary index of a graph is defined as <span class="math"><em...

Full description

Bibliographic Details
Main Authors: Hanyuan Deng, Selvaraj Balachandran, Suresh Elumalai, Toufik Mansour
Format: Article
Language:English
Published: Indonesian Combinatorial Society (InaCombS); Graph Theory and Applications (GTA) Research Centre; University of Newcastle, Australia; Institut Teknologi Bandung (ITB), Indonesia 2019-10-01
Series:Electronic Journal of Graph Theory and Applications
Subjects:
harary index, bipartite graph, matching number, vertex-connectivity, edge-connectivity
Online Access:https://www.ejgta.org/index.php/ejgta/article/view/710

Internet

https://www.ejgta.org/index.php/ejgta/article/view/710

Similar Items