Maximum H-index of bipartite network with some given parameters

AIMS Mathematics

Shahid Zaman¹  Fouad A. Abolaban²  Muhammad Ahsan Asim³  Ali Ahmad³ 

[1] 1. Department of Mathematics, University of Sialkot, Sialkot 51310, Pakistan 2. Faculty of Mathematics and Statistics, Central China Normal University, Wuhan 430079, China;3. King Abdulaziz University, College of Engineering, Nuclear Engineering Department, Jeddah, Kingdom of Saudi Arabia, Jeddah 21589, Saudi Arabia;4. College of Computer Science and Information Technology, Jazan University, Jazan, Saudi Arabia;

关键词: h-index;    bipartite network;    matching number;    independence number;    cover of a network;    diameter;   

DOI  :  10.3934/math.2021306

来源: DOAJ

【 摘 要 】

A network is an abstract structure that consists of nodes that are connected by links. A bipartite network is a type of networks where the set of nodes can be divided into two disjoint sets in a way that each link connects a node from one partition with a node from the other partition. In this paper, we first determine the maximum H-index of networks in the class of all n-node connected bipartite network with matching number t. We obtain that the maximum H-index of a bipartite network with a given matching number is K_t,n−t. Secondly, we characterize the network with the maximum H-index in the class of all the n-vertex connected bipartite network of given diameter. Based on our obtain results, we establish the unique bipartite network with maximum H-index among bipartite networks with a given independence number and cover of a network.

【 授权许可】

Unknown