.svg){kind=logo}
CONVEX NEIGHBORHOOD POLYNOMIAL OF PLANAR GRIDS
Keywords:
convex subnetwork, security analysis, graph neural network, secure network design, graph polynomial, planar gridDOI:
https://doi.org/10.17654/0972087126009Abstract
Convexity in networks has been defined as a property of each subgraph to include all shortest paths between its nodes. It has practical applications in network optimization problems, distributed algorithms, and graph-based machine learning, impacting the complexity of graph algorithms and enabling the analysis of real-world networks. While convex substructures are important, the neighborhood systems of these substructures contribute significantly to the entire functionality of the network structure. In this paper, we introduce the idea of convex neighborhood polynomial as a representation of convex substructures with corresponding cardinality of their neighborhood systems. In particular, we determine the convex neighborhood polynomial of planar grids.
Received: June 9, 2025
Revised: September 1, 2025
Accepted: September 19, 2025
References
[1] S. C. Abdurasid, B. J. Amiruddin, J. I. C. Salim and R. G. Artes Jr., Convex neighborhood polynomial of graphs, Advances and Applications in Discrete Mathematics 40(1) (2023), 125-137.
[2] A. L. Arriesgado and R. G. Artes Jr., Convex independent common neighborhood polynomial of a graph, Advances and Applications in Discrete Mathematics 38(2) (2023), 145-158.
[3] A. L. Arriesgado, J. I. C. Salim and R. G. Artes Jr., Clique connected common neighborhood polynomial of the join of graphs, Int. J. Math. Comput. Sci. 18(4) (2023), 655-659.
[4] R. G. Artes Jr., M. M. Ortega, A. L. B. Quinones, C. C. Bongabong and C. A. P. Genovia, Interrelations between clique polynomials and convex neighborhood polynomials, Int. J. Math. Comput. Sci. 20(3) (2025), 779-783.
[5] R. G. Artes Jr., C. A. Villarta, H. A. Adoh and J. I. C. Salim, Neighborhood systems of convex sets in generalized fans: a polynomial representation, Int. J. Math. Comput. Sci. 20(2) (2025), 659-662.
[6] J. Ellis-Monaghan and J. Merino, Graph Polynomials and their Applications II: Interrelations and Interpretations, Birkhauser, Boston, 2011.
[7] D. Gavrilev and I. Makarov, Fast approximate convex hull construction in networks via node embedding, IEEE Access 11 (2023), 54588-54595.
[8] A. L. Lahaman, B. H. Arriola, J. I. C. Salim and R. A. Rasid, Convex neighborhood polynomial of generalized wheel, Int. J. Math. Comput. Sci. 20(1) (2025), 161-164.
[9] L. S. Laja and R. G. Artes Jr., Zeros of convex subgraph polynomials, Applied Mathematical Sciences 8(59) (2014), 2917-2923.
[10] E. M. Machutes, S. A. Arriola, R. A. Rasid and B. J. Amiruddin-Rajik, Polynomial representation of biclique neighborhood in graphs, Int. J. Math. Comput. Sci. 20(1) (2025), 157-160.
[11] K. S. Savitha and A. Vijayakumar, On some convexity parameters of Sierpiński graphs, Indian J. Pure Appl. Math. (2025).
https://doi.org/10.1007/s13226-025-00769-7.
[12] X. Tellier, C. Douthe, L. Hauswirth and O. Baverel, Surfaces with planar curvature lines: Discretization, generation and application to the rationalization of curved architectural envelopes, Automation in Construction 106 (2019), 102880.
Downloads
Published
Issue
Section
License
Copyright (c) 2025 Copyright ©2025 The Author(s)
This work is licensed under a Creative Commons Attribution 4.0 International License.
_________________________
Attribution: Credit Pushpa Publishing House as the original publisher, including title and author(s) if applicable.
Non-Commercial Use: For non-commercial purposes only. No commercial activities without explicit permission.
Contact Puspha Publishing House for more info or permissions.
