[PDF][PDF] Domination integrity in trees

R Sundareswaran, V Swaminathan - Bulletin of International …, 2012 - imvibl.org
DOMINATION INTEGRITY IN TREES Page 1 BULLETIN OF INTERNATIONAL MATHEMATICAL
VIRTUAL INSTITUTE ISSN 1840-4367 Vol. 2(2012), 153-161 Former BULLETIN OF SOCIETY …

Integrity of wheel related graphs

B Basavanagoud, S Policepatil - Punjab University Journal of …, 2021 - journals.pu.edu.pk
Punjab University Journal of Mathematics (2021),53(5),329-338 https://doi.org/10.52280/pujm.2021.530503
Integrity of Wheel Relat Page 1 Punjab University Journal of Mathematics (2021),53(5),329-338 …

Integrity of graph operations

B Basavanagoud, S Policepatil… - Transactions on …, 2021 - toc.ui.ac.ir
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 …

On the weak-integrity of graphs

A Kirlangic - Journal of Mathematical Modelling and Algorithms, 2003 - Springer
Connectivity has been used in the past to describe the stability of graphs. If two graphs have
the same connectivity, then it does not distinguish between these graphs. That is, the …

Inverse domination integrity of graphs

B Basavanagoud, S Policepatil - TWMS Journal Of Applied …, 2024 - belgelik.isikun.edu.tr
With the growing demand for information transport, networks and network architecture have
grown increasingly vital. Nodes and the connections that connect them make up a …

[PDF][PDF] Parameters of vulnerability in graphs

R Sundareswaran, V Swaminathan - 2010 - researchgate.net
Integrity as a vulnerability parameter has been studied by many authors. In this chapter,
some interesting properties like I-excellence, Just I-excellence, Bondage Integrity number …

Vulnerability: Integrity of a middle graph

A Ataç, Ş Çelik - 2008 - acikerisim.selcuk.edu.tr
Özet A communication network can be considered to be highly vulnerable to disruption if the
destruction of a few elements can result in no member's being able to communicate with …

Graph operations and neighbor-integrity

A Kırlangıc - Mathematica Bohemica, 2004 - dml.cz
Let $ G $ be a graph. A vertex subversion strategy of $ G $, say $ S $, is a set of vertices in $
G $ whose closed neighborhood is removed from $ G $. The survival-subgraph is denoted …

On the weak-integrity of trees

A Kirlangic - Turkish Journal of Mathematics, 2003 - journals.tubitak.gov.tr
In this paper the concept of {\em weak-integrity} is introduced as a new measure of the
stability of a graph\(G\) and it is defined as I_ {w}(G)={\min_ {S\subset V (G)}\{S+ m …

Integrity of generalized transformation graphs

B Basavanagoud, S Policepatil - Ratio Mathematica, 2021 - search.proquest.com
The values of vulnerability helps the network designers to construct such a communication
network which remains stable after some of its nodes or communication links are damaged …