vulnerability parameters of tensor product of complete equipartite graphs

Clicks: 281
ID: 159284
2013
Article Quality & Performance Metrics
Overall Quality
Not rated
Combines reader engagement with the AI quality analysis. This article has not been analysed, so there is no overall score — reader engagement is measured and shown alongside.
AI Quality Assessment
Not analyzed
Readership in this journal
Steady

Ranked #24 of 95 articles by views in zhonghua yi xue za zhi

Most read Least read

Bar heights use a square-root scale.

Mint this article as an NFT
Not yet minted

Create a permanent, verifiable on-chain record of this article on the Scimatic Network. The NFT is held in your Journament account, and you can withdraw it to your own wallet at any time.

5 SUSD one-off · no wallet required
Abstract
Let \(G_{1}\) and \(G_{2}\) be two simple graphs. The tensor product of \(G_{1}\) and \(G_{2}\), denoted by \(G_{1}\times G_{2}\), has vertex set \(V(G_{1}\times G_{2})=V(G_{1})\times V(G_{2})\) and edge set \(E(G_{1}\times G_{2})=\{(u_{1},v_{1})(u_{2},v_{2}):u_{1}u_{2}\in E(G_{1})\) and \(v_{1}v_{2}\in E(G_{2})\}\). In this paper, we determine vulnerability parameters such as toughness, scattering number, integrity and tenacity of the tensor product of the graphs \(K_{r(s)}\times K_{m(n)}\) for \(r\geq 3, m\geq 3, s\geq 1\) and \(n\geq 1,\) where \(K_{r(s)}\) denotes the complete \(r\)-partite graph in which each part has \(s\) vertices. Using the results obtained here the theorems proved in [Aygul Mamut, Elkin Vumar, Vertex Vulnerability Parameters of Kronecker Products of Complete Graphs, Information Processing Letters 106 (2008), 258-262] are obtained as corollaries.
Reference Key
paulraja2013opusculavulnerability Use this key to autocite in the manuscript while using SciMatic Manuscript Manager or Thesis Manager
Authors
Journal zhonghua yi xue za zhi
Year 2013
DOI
http://dx.doi.org/10.7494/OpMath.2013.33.4.741
URL
Keywords

Citations

No citations found. To add a citation, contact the admin at info@scimatic.org

No comments yet. Be the first to comment on this article.