There are several approaches to lower the complexity of huge networks. One of the key notions is that of twin nodes, exhibiting the same connection pattern to the rest of the network. We extend this idea by defining a twin preserving spanning subgraph (TPS-subgraph) of a simple graph as a tool to compute certain graph related invariants which are preserved by the subgraph. We discuss how these subgraphs preserve some distance based parameters of the simple graph. We introduce a sub-skeleton graph on a vector space and examine its basic properties. The sub-skeleton graph is a TPS-subgraph of the non-zero component graph defined over a vector space. We prove that some parameters like the metric-dimension are preserved by the sub-skeleton graph.
AliU., BokharyS.A., WahidK. and AbbasG., On Resolvability of a Graph Associated to a Finite Vector Space, J Algebra Appl19(2) (2019), 1950029 (10 pages).
2.
AminiA., AminiB., MomtahanE. and HaghighiM.H.S, On a Graph of Ideals, Acta Math Hungar134(3) (2012), 369–384.
3.
AndersonD.F. and LivingstonP.S., The zero-divisor graph of a commutative ring, J Algebra217 (1999), 434–447.
4.
BadawiA., On the Dot Product Graph of a Commutative Ring, Comm Algebra43(1) (2015), 43–50.
5.
BeckI., Coloring of commutative rings, J Algebra116 (1988), 208–226.
6.
BuczkowskiP.S., ChartrandG., PoissonC. and ZhangP., On k-dimensional graphs and their bases, Period Math Hungar46 (2003), 9–15.
7.
CancanM., On Ev-degree and Ve-degree topological properties of Tickysim spiking neural network, Comput Intell Neurosci8 (2019), 11–31.
8.
CaleyA., Desiderata and suggestions: No. 2. The Theory of groups: graphical representation, Am J Math1(2) (1878), 174–176.
9.
CameronP.J. and GhoshS., The power graph of a finite group, Discrete Math311 (2011), 1220–1222.
10.
ChakrabartyI., GhoshS., MukherjeeT.K. and SenM.K., Intersection graphs of ideals of rings, Discrete Math309(17) (2009), 5381–5392.
11.
ChakrabartyI., GhoshS. and SenM.K., Undirected power graphs of semigroups, Semigroup Forum78 (2009), 410–426.
12.
ChartrandG., ErohL., JohnsonA.M. and OellermannR.O., Resolvability in graphs and metric dimension of a graph, Discrete Appl Math105 (2000), 99–133.
13.
ChartrandG., SalehiE. and ZhangP., The partition dimension of a graph, Aequationes Math59 (2000), 45–54.
14.
CharttrandI. and ZhangP., The theory and application of resolvability in graphs, A Survey, Congr Numer160 (2003), 47–68.
15.
DasA., Non-zero component graph of a finite dimensional vector space, Comm Algebra44(9) (2016), 3918–3926.
16.
DasA., Non-zero component union graph of a finite dimensional vector space, Linear Multilinear Algebra65(6) (2017), 1276–1287.
17.
DasA., Subspace inclusion graph of a vector space, Comm Algebra44(11) (2016), 4724–4731.
18.
DasA., On subspace inclusion graph of a vector space, Linear Multilinear Algebra66(3) (2018), 554–564.
19.
DasA., On non-zero component graph of vector spaces over finite fields, J Algebra Appl16 (2016), 1750007.
20.
HararyF. and MelterR.A., On the metric dimension of a graph, Ars Comb2 (1976), 191–195.
21.
HenningM.A., and Oellermann, Metric-locationg-dominating sets in graphs, Ars Comb73 (2004), 129–141.
22.
HernandoC., MoraM., PelayaI.M., SearaC. and WoodD.R., Extremal graph theory for metric dimension and diameter, Electron Notes Discrete Math29 (2007), 339–343.
MajiD. and GhoraiG., A novel graph invariant: The third leap Zagreb index under several graph operations, Discret Math Algorithms Appl11(05) (2019), 1950054.
25.
NikandishR., MaimaniH.R. and KhaksariA., Coloring of a non-zero component graph associated with a finite dimensional vector space, J Algebra Appl16 (2017), 1750173.
26.
PlesnikJ., Critical graphs of given diameter, Acta Fac Rerum Natur Univ Comenian Math30 (1975), 71–93.
27.
RiazaR., Twin subgraphs and core-semiperiphery-periphery structures, Complexity Article ID 2547270 (2018), 71–93.
28.
SeböA. and TannierE., On metric generators of graph, Math Oper Res29(2) (2004), 383–393.
29.
SlaterP.J., Dominating and reference sets in graphs, J Math Phys Sci22 (1988), 445–455.
30.
SlaterP.J., Leaves of trees, Congress Numer14 (1975), 549–559.
31.
SpernerE., Ein Satz "uber Untermenger einer endlichen Menge, Math Z27 (1928), 544–548.
32.
TalebiY., EsmaeilifarM.S. and AzizpourS., A kind of intersection graph of vector space, J Discrete Math Sci Cryptogr12(6) (2009), 681–689.
33.
WestD.B., Introduction to Graph Theory, Prentice Hall, 2001.
