Open AccessPreclusion for Radix Triangular Mesh
Author(s) -
D. A. Xavier C. J. Deeni
Publication year - 2013
Publication title -
mapana journal of sciences
Language(s) - English
Resource type - Journals
ISSN - 0975-3303
DOI - 10.12723/mjs.26.9
Subject(s) - combinatorics , matching (statistics) , mathematics , set (abstract data type) , discrete mathematics , computer science , statistics , programming language
In this paper we find the values of mp(T n ) and mp 1 (T n ) when n(n+1)≡0 (mod 4). Every minimum matching preclusion set in an n-triangular mesh network is trivial. Also, mp(G) ≤ δ(G), where δ(G) is the minimum degree of G and mp 1 (G) ≤ v e (G).
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom