New Results on Open Support of Graphs under
Addition

Amin Li; Shufei Wu

doi:https://doi.org/10.14445/22315373/IJMTT-V68I2P506

International Journal of Mathematics Trends and Technology

Research Article | Open Access | Download PDF

Volume 68 | Issue 2 | Year 2022 | Article Id. IJMTT-V68I2P506 | DOI : https://doi.org/10.14445/22315373/IJMTT-V68I2P506

New Results on Open Support of Graphs under Addition

Amin Li, Shufei Wu

Abstract

Let G = (V, E) be a graph. For each v ε V, the open support of v under addition, denoted by supp(v), is the sum of degrees of vertices adjacent to v. The open support of G under addition is the sum of supports of all its vertices. In this paper, we determined the open support of some special types of graphs. We also defined the open support of an edge under addition and showed its connection with the open support of a G.

Keywords

Open support, Neighborhood, Degree, Adjacency matrix, Incidence matrix

References

[1] A. Ahmad, M. Arshad, and G. Ižaríková, Irregular labelings of helm and sun graphs, AKCE International Journal of Graphs and Combinatorics, 12(2-3) (2015) 161-168.
[2] S. Balamurugan, M. Anitha, P. Aristotle, C. Karnan, A Note on Open Support of a Graph under Addition I, International Journal of Mathematics Trends and Technology, 65(5) (2019) 110-114.
[3] S. Balamurugan, M. Anitha, P. Aristotle, C. Karnan, A Note on Open Support of a Graph under Addition II, International Journal of Mathematics Trends and Technology, 65(5) (2019) 115-119.
[4] S. Balamurugan, M. Anitha, C. Karnan, Closed Support of a Graph under Addition I, International Journal of Mathematics Trends and Technology, 65(5) (2019) 115-119.
[5] S. Balamurugan, M. Anitha, C. Karnan, P. Palanikumar, Closed Support of a Graph under Addition II, International Journal of Mathematics Trends and Technology, 65(5) (2019) 123-128.
[6] J. A. Bondy, and U. Murty, Graph Theory, 2008.
[7] Gross, and L. Jonathan, Graph Theory and Its Applications, Second Edition (Discrete Mathematics and Its Applications), Chapman & Hall/CRC, 2005.
[8] R. K. Guy, and F. Harary, On the Möbius ladders, Canad.math.bull, 10 (1967) 493-496.
[9] M. Jeyalakshmi, and N. Meena, Open support of some special types of graphs under addition. World Scientific News, 156 (2021) 130-146.
[10] A. Pasotti, Constructions for cyclic Möbius ladder systems. Discrete Mathematics, 310(22) (2010) 3080-3087.
[11] A. Ranganathan, A Textbook of Graph Theory, Springer, (2012).
[12] H.K. Qureshi, S. Rizvi, M. Saleem, S.A. Khayam, V. Rakocevic, M. Rajarajan, Evaluation and improvement of CDS-based topology control for wireless sensor networks, Wireless Networks, 19 (2013) 31-46.
[13] J. Denes, A.D. Keedwell, Latin Squares And One-Factorizations Of Complete Graphs - (Ii)Enumerating One-Factorizations Of The Complete Directed Graph Kn-Star Using Macmahon Double Partition Idea, Utilitas Mathematica, 34 (1988) 73-83.
[14] M. Unser, B.L. Trus, J. Frank, A.C. Steven, The spectral signal-to-noise ratio resolution criterion: Computational efficiency and statistical precision, Ultramicroscopy, 30 (1989) 429-434.
[15] A.K. Das, Exploring the glass transition region: crowding effect, nonergodicity and thermorheological complexity, Physical Chemistry Chemical Physics, 17 (2015) 16110-16124.
[16] W. Golab, R. Boutaba, Path selection in user-controlled circuit-switched optical networks, Optical Switching and Networking, 5 (2008) 123-138.
[17] S. Creemers, R. Leus, M. Lambrecht, Scheduling Markovian PERT networks to maximize the net present value, Operations Research Letters, 38 (2010) 51-56.
[18] L.-g. Dong, Efficient movie retrieval strategies for movie-on-demand multimedia services on distributed networks, Multimedia Tools and Applications, 20 (2003) 99-133.
[19] W. Chin, C. Yang, V.W.L. Ng, Y. Huang, J. Cheng, Y.W. Tong, D.J. Coady, W. Fan, J.L. Hedrick, Y.Y. Yang, Biodegradable Broad-Spectrum Antimicrobial Polycarbonates: Investigating the Role of Chemical Structure on Activity and Selectivity, Macromolecules, 46 (2013) 8797-8807.
[20] A. Ashari, N. Sedaghati, J. Eisenlohr, P. Sadayappan, A model-driven blocking strategy for load balanced sparse matrix¨Cvector multiplication on GPUs, Journal of Parallel and Distributed Computing, 76 (2015) 3-15.
[21] N.K. Singhal, B. Mukherjee, Protectilng multicast sessions in WDM optical mesh networks, Journal Of Lightwave Technology, 21 (2003) 884-892.
[22] H. Cho, An Energy-Efficient Periodic Data Collection using Dynamic Cluster Management Method in Wireless Sensor Network, Journal of IEMEK, 5 (2010) 206-216.
[23] O. Sinanoglu, Improving the Effectiveness of Combinational Decompressors Through Judicious Partitioning of Scan Cells, Journal of Electronic Testing, 24 (2008) 439-448.
[24] D. Park, B. Debnath, D.H.C. Du, A Dynamic Switching Flash Translation Layer Based on Page-Level Mapping, IEICE Transactions on Information and Systems, E99.D, (2016) 1502-1511.
[25] A.T. Ihler, J.W. Fisher, R.L. Moses, A.S. Willsky, Nonparametric belief propagation for self-localization of sensor networks, IEEE Journal on Selected Areas in Communications, 23 (2005) 809-819.

Citation :

Amin Li, Shufei Wu, "New Results on Open Support of Graphs under Addition," International Journal of Mathematics Trends and Technology (IJMTT), vol. 68, no. 2, pp. 32-42, 2022. Crossref, https://doi.org/10.14445/22315373/IJMTT-V68I2P506