Open Access
| Issue |
RAIRO-Theor. Inf. Appl.
Volume 60, 2026
|
|
|---|---|---|
| Article Number | 11 | |
| Number of page(s) | 10 | |
| DOI | https://doi.org/10.1051/ita/2026012 | |
| Published online | 17 March 2026 | |
- H.E. Dudeney, Amusements in Mathematics. Nelson, Edinburgh (1917). [Google Scholar]
- K. Yakubo and Y. Fujiki, A general model of hierarchical fractal scale-free networks. PLoS One 17 (2022) number e0264589. [Google Scholar]
- E. Ravasz and A.L. Barabasi, Hierarchical organization in complex networks. Phys. Rev. E 67 (2003) number 026112. [Google Scholar]
- A. Miralles, F. Comellas, L. Chen and Z. Zhang, Planar unclustered scale-free graphs as models for technological and biological networks. Phys. A 389 (2010) 1955–1964. [Google Scholar]
- J.A. Bondy and U.S.R. Murty, Graph Theory with Applications. Macmillan London (1976). [Google Scholar]
- P. Manuel and S. KlavZar, A general position problem in graph theory. Bull. Aust. Math. Soc. 98 (2018) 177–187. [Google Scholar]
- S.V.U. Chandran and G.J. Parthasarathy, The geodesic irredundant sets in graphs. Int. J. Math. Combin. 4 (2016) 135–143. [Google Scholar]
- P. Manuel and S. Klavžar, The graph theory general position problem on some interconnection networks. Fund. Inform. 163 (2018) 339–350. [Google Scholar]
- B.S. Anand, U. Chandran, M. Changat, S. KlavZar and E.J. Thomas, Characterization of general position sets and its applications to cographs and bipartite graphs. Appl. Math. Comput. 359 (2019) 84–89. [Google Scholar]
- S. KlavZar and G. Rus, The general position number of integer lattices. Appl. Math. Comput. 390 (2021) number 125664. [Google Scholar]
- S.V.U. Chandran, S. KlavZar and J. Tuite, The general position problem: a survey. arXiv:2501.19385. [Google Scholar]
- A.L. Barabási, Network science. Philos. Trans. Roy. Soc. A 371 (2013) number 20120375. [Google Scholar]
- A.L. Barabási and R. Albert, Emergence of scaling in random networks. Science 286 (1999) 509–512. [Google Scholar]
- B. Bollobas and O.M. Riordan, Mathematical results on scale-free random graphs, In Handbook of Graphs and Networks: From the Genome to the Internet (2003) 1–34. [Google Scholar]
- A. Bandyopadhyay, A.K. Dhar and S. Basu, Graph coloring: a novel heuristic based on trailing path - properties, perspective and applications in structured networks. Soft Comput. 24 (2020) 603–625. [Google Scholar]
- C. Yang, B. Yao, H.Y. Wang, X. Chen and S.H. Yang, Graph colorings applied in scale-free networks. Adv. Mater. Res. 760 (2013) 2199–2204. [Google Scholar]
- F. Molnár, S. Sreenivasan, B.K. SZymanski and G. Korniss, Minimum dominating sets in scale-free network ensembles. Sci. Rep. 3 (2013) number 1736. [Google Scholar]
- L. Shan, H. Li and Z. Zhang, Domination number and minimum dominating sets in pseudofractal scale-free web and Sierpinński graph. Theoret. Comput. Sci. 677 (2017) 12–30. [Google Scholar]
- S.N. Dorogovtsev, A.V. Goltsev and J.F.F. Mendes, Pseudofractal scale-free web. Phys. Rev. E 65 (2002) number 066122. [Google Scholar]
- M.E.J. Newman, The structure and function of complex networks. SIAM Rev. 45 (2003) 167–256. [CrossRef] [MathSciNet] [Google Scholar]
- J.D. Noh, Exact scaling properties of a hierarchical network model. Phys. Rev. E 67 (2003) number 045103. [Google Scholar]
- Y.S. Lim, D.S. Menasché, B. Ribeiro, D. Towsley and P. Basu, Online estimating the k central nodes of a network. 2011 IEEE Network Science Workshop (2011) 118–122. [Google Scholar]
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.