These tools will no longer be maintained as of December 31, 2024. Archived website can be found here. PubMed4Hh GitHub repository can be found here. Contact NLM Customer Service if you have questions.
107 related articles for article (PubMed ID: 37925527)
1. On the [Formula: see text]-anonymity of networks via their k-metric antidimension. Fernández E; Kuziak D; Munoz-Marquez M; Yero IG Sci Rep; 2023 Nov; 13(1):19090. PubMed ID: 37925527 [TBL] [Abstract][Full Text] [Related]
2. Structure of the space of taboo-free sequences. Manuel C; von Haeseler A J Math Biol; 2020 Nov; 81(4-5):1029-1057. PubMed ID: 32940748 [TBL] [Abstract][Full Text] [Related]
3. Spectral properties of a class of unicyclic graphs. Du Z J Inequal Appl; 2017; 2017(1):96. PubMed ID: 28529433 [TBL] [Abstract][Full Text] [Related]
4. Accessibility percolation on Cartesian power graphs. Schmiegelt B; Krug J J Math Biol; 2023 Feb; 86(3):46. PubMed ID: 36790641 [TBL] [Abstract][Full Text] [Related]
5. Discontinuous phase transitions in the q-voter model with generalized anticonformity on random graphs. Abramiuk-Szurlej A; Lipiecki A; Pawłowski J; Sznajd-Weron K Sci Rep; 2021 Sep; 11(1):17719. PubMed ID: 34489517 [TBL] [Abstract][Full Text] [Related]
6. A novel method for inference of acyclic chemical compounds with bounded branch-height based on artificial neural networks and integer programming. Azam NA; Zhu J; Sun Y; Shi Y; Shurbevski A; Zhao L; Nagamochi H; Akutsu T Algorithms Mol Biol; 2021 Aug; 16(1):18. PubMed ID: 34391471 [TBL] [Abstract][Full Text] [Related]
7. Isoscattering strings of concatenating graphs and networks. Ławniczak M; Sawicki A; Białous M; Sirko L Sci Rep; 2021 Jan; 11(1):1575. PubMed ID: 33452312 [TBL] [Abstract][Full Text] [Related]
8. Clustering systems of phylogenetic networks. Hellmuth M; Schaller D; Stadler PF Theory Biosci; 2023 Nov; 142(4):301-358. PubMed ID: 37573261 [TBL] [Abstract][Full Text] [Related]
9. Bounds for the general sum-connectivity index of composite graphs. Akhter S; Imran M; Raza Z J Inequal Appl; 2017; 2017(1):76. PubMed ID: 28469353 [TBL] [Abstract][Full Text] [Related]
10. Sitting Closer to Friends than Enemies, Revisited. Cygan M; Pilipczuk M; Pilipczuk M; Wojtaszczyk JO Theory Comput Syst; 2015; 56(2):394-405. PubMed ID: 26300686 [TBL] [Abstract][Full Text] [Related]
11. Interval-valued fuzzy [Formula: see text]-tolerance competition graphs. Pramanik T; Samanta S; Pal M; Mondal S; Sarkar B Springerplus; 2016; 5(1):1981. PubMed ID: 27917352 [TBL] [Abstract][Full Text] [Related]
12. Locational privacy-preserving distance computations with intersecting sets of randomly labeled grid points. Schnell R; Klingwort J; Farrow JM Int J Health Geogr; 2021 Mar; 20(1):14. PubMed ID: 33743719 [TBL] [Abstract][Full Text] [Related]
13. A new spectral invariant for quantum graphs. Ławniczak M; Kurasov P; Bauch S; Białous M; Akhshani A; Sirko L Sci Rep; 2021 Jul; 11(1):15342. PubMed ID: 34321508 [TBL] [Abstract][Full Text] [Related]
14. A novel method for assessing and measuring homophily in networks through second-order statistics. Apollonio N; Franciosa PG; Santoni D Sci Rep; 2022 Jun; 12(1):9757. PubMed ID: 35697749 [TBL] [Abstract][Full Text] [Related]
15. Eigenvalues of the resistance-distance matrix of complete multipartite graphs. Das KC; Yang Y J Inequal Appl; 2017; 2017(1):296. PubMed ID: 29213201 [TBL] [Abstract][Full Text] [Related]
16. On the characterization of claw-free graphs with given total restrained domination number. Pi X Springerplus; 2016; 5(1):1753. PubMed ID: 27795896 [TBL] [Abstract][Full Text] [Related]
17. Context-free pairs of groups I: Context-free pairs and graphs. Ceccherini-Silberstein T; Woess W Eur J Comb; 2012 Oct; 33(7):1449-1466. PubMed ID: 27087724 [TBL] [Abstract][Full Text] [Related]
18. NetMODE: network motif detection without Nauty. Li X; Stones DS; Wang H; Deng H; Liu X; Wang G PLoS One; 2012; 7(12):e50093. PubMed ID: 23272055 [TBL] [Abstract][Full Text] [Related]
19. StreAM-[Formula: see text]: algorithms for analyzing coarse grained RNA dynamics based on Markov models of connectivity-graphs. Jager S; Schiller B; Babel P; Blumenroth M; Strufe T; Hamacher K Algorithms Mol Biol; 2017; 12():15. PubMed ID: 28572834 [TBL] [Abstract][Full Text] [Related]
20. The small world coefficient 4.8 ± 1 optimizes information processing in 2D neuronal networks. Aprile F; Onesto V; Gentile F NPJ Syst Biol Appl; 2022 Jan; 8(1):4. PubMed ID: 35087062 [TBL] [Abstract][Full Text] [Related] [Next] [New Search]