Integrity of graph operations
Publish place: Transactions on Combinatorics، Vol: 10، Issue: 3
Publish Year: 1400
نوع سند: مقاله ژورنالی
زبان: English
View: 136
This Paper With 15 Page And PDF Format Ready To Download
- Certificate
- من نویسنده این مقاله هستم
استخراج به نرم افزارهای پژوهشی:
شناسه ملی سند علمی:
JR_COMB-10-3_004
تاریخ نمایه سازی: 17 خرداد 1400
Abstract:
A communication network can be considered to be highly vulnerable to disruption if the failure of few members (nodes or links) can result in no members being able to communicate with very many others. These communication networks can be modeled through graphs. There are several graph-theoretic parameters to describe the stability of graphs. But, these parameters are not sufficient to study stability of graphs. This leads to the concept of integrity of a graph. In this paper, we obtain the integrity of some graph operations and some special graphs which can help us to reconstruct the given network in such a way that it is more stable than the earlier one.
Keywords:
Authors
B. Basavanagoud
Department of Mathematics, Karnatak University, Dharwad - ۵۸۰ ۰۰۳, Karnataka, India
Shruti Policepatil
Department of Mathematics, Karnatak University, Dharwad - ۵۸۰ ۰۰۳, Karnataka, India
Praveen Jakkannavar
Department of Mathematics, Karnatak University, Dharwad - ۵۸۰ ۰۰۳, Karnataka, India