Harary index of bipartite graphs

Hanyuan Deng; Selvaraj Balachandran; Suresh Elumalai; Toufik Mansour

doi:10.5614/ejgta.2019.7.2.12

Harary index of bipartite graphs

Hanyuan Deng
, Selvaraj Balachandran
, Suresh Elumalai
, Toufik Mansour

Department of Mathematics

Research output: Contribution to journal › Article › peer-review

Abstract

The sum of reciprocals of distance between any two vertices in a graph G is called the Harary index. We determine the n-vertex extremal graphs with the maximum Harary index for all bipartite graphs, a given matching number, a given vertex-connectivity, and with a given edge-connectivity, respectively.

Original language	English
Pages (from-to)	365-372
Number of pages	8
Journal	Electronic Journal of Graph Theory and Applications
Volume	7
Issue number	2
DOIs	https://doi.org/10.5614/ejgta.2019.7.2.12
State	Published - 2019

Bibliographical note

Publisher Copyright:
© 2019, Indonesian Combinatorics Society.

Keywords

Bipartite graph
Edge-connectivity Mathematics Subject Classification
Harary index
Matching number
Vertex-connectivity

ASJC Scopus subject areas

Discrete Mathematics and Combinatorics
Applied Mathematics

Access to Document

10.5614/ejgta.2019.7.2.12

Cite this

@article{fad6ee70898443dba2bc22b5cbda3876,

title = "Harary index of bipartite graphs",

abstract = "The sum of reciprocals of distance between any two vertices in a graph G is called the Harary index. We determine the n-vertex extremal graphs with the maximum Harary index for all bipartite graphs, a given matching number, a given vertex-connectivity, and with a given edge-connectivity, respectively.",

keywords = "Bipartite graph, Edge-connectivity Mathematics Subject Classification, Harary index, Matching number, Vertex-connectivity",

author = "Hanyuan Deng and Selvaraj Balachandran and Suresh Elumalai and Toufik Mansour",

note = "Publisher Copyright: {\textcopyright} 2019, Indonesian Combinatorics Society.",

year = "2019",

doi = "10.5614/ejgta.2019.7.2.12",

language = "English",

volume = "7",

pages = "365--372",

journal = "Electronic Journal of Graph Theory and Applications",

issn = "2338-2287",

publisher = "Indonesian Combinatorics Society",

number = "2",

}

TY - JOUR

T1 - Harary index of bipartite graphs

AU - Deng, Hanyuan

AU - Balachandran, Selvaraj

AU - Elumalai, Suresh

AU - Mansour, Toufik

PY - 2019

Y1 - 2019

N2 - The sum of reciprocals of distance between any two vertices in a graph G is called the Harary index. We determine the n-vertex extremal graphs with the maximum Harary index for all bipartite graphs, a given matching number, a given vertex-connectivity, and with a given edge-connectivity, respectively.

AB - The sum of reciprocals of distance between any two vertices in a graph G is called the Harary index. We determine the n-vertex extremal graphs with the maximum Harary index for all bipartite graphs, a given matching number, a given vertex-connectivity, and with a given edge-connectivity, respectively.

KW - Bipartite graph

KW - Edge-connectivity Mathematics Subject Classification

KW - Harary index

KW - Matching number

KW - Vertex-connectivity

UR - https://www.scopus.com/pages/publications/85074722012

U2 - 10.5614/ejgta.2019.7.2.12

DO - 10.5614/ejgta.2019.7.2.12

M3 - Article

AN - SCOPUS:85074722012

SN - 2338-2287

VL - 7

SP - 365

EP - 372

JO - Electronic Journal of Graph Theory and Applications

JF - Electronic Journal of Graph Theory and Applications

IS - 2

ER -

Harary index of bipartite graphs

Abstract

Bibliographical note

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this