SPLIT AND NON-SPLIT HUB NUMBER OF GRAPHS

A split hub set S in a graph G is a hub set such that the induced subgraph is disconnected. The split hub number of G, denoted by [h.sub.s](G) is the minimum size of a split hub set in G. In this paper, the split hub number for several classes of graphs is computed and we investigate the relationsh...

Full description

Saved in:
Bibliographic Details
Published in:TWMS journal of applied and engineering mathematics 2022-09, Vol.12 (4), p.1410
Main Authors: Pavithra, M, Sharada, B
Format: Article
Language:English
Subjects:
Computation
Graph theory
Graphs
Mathematical research
Mathematics
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:A split hub set S in a graph G is a hub set such that the induced subgraph is disconnected. The split hub number of G, denoted by [h.sub.s](G) is the minimum size of a split hub set in G. In this paper, the split hub number for several classes of graphs is computed and we investigate the relationship of [h.sub.s](G) with other known parameters of G. Also the concept of non-split hub number is introduced and its exact values for some standard graphs are computed. Keywords: Hub set, A split hub set, A non-split hub set. AMS Subject Classification: 05C40, 05C99.
ISSN:2146-1147
2146-1147