Coprime networks of the composite numbers: pseudo-randomness and synchronizability

DOI10.1016/j.dam.2024.04.024zbMATH Open1541.05168MaRDI QIDQ6559395

Chittaranjan Hens, MD Rahil Miraj, Dibakar Ghosh

Publication date: 21 June 2024

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

network sciencepseudo-random graphcomposite numbers

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Random graphs (graph-theoretic aspects) (05C80) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Arithmetic functions; related numbers; inversion formulas (11A25) Primes (11A41)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• \(\lambda_ 1\), isoperimetric inequalities for graphs, and superconcentrators
• Eigenvalues and expanders
• Statistical mechanics of complex networks. Selected contributions from the XVIII Sitges Conference ``Statistical mechanics of complex networks, Sitges, Barcelona, Spain, June 10--14, 2002
• Optimizing synchronizability in networks of coupled systems
• Complex networks: structure and dynamics
• Synchronization in oscillatory networks
• Synchronization: a universal concept in nonlinear sciences
• The probability that \(k\) positive integers are pairwise relatively prime
• The probabilistic method
• Statistical mechanics of complex networks
• Resilient Pancyclicity of Random and Pseudorandom Graphs
• Ramanujan Primes and Bertrand's Postulate
• Multicolored Hamilton Cycles and Perfect Matchings in Pseudorandom Graphs
• Dynamical Processes on Complex Networks
• Quasi-random graphs
• Networks

This page was built for publication: Coprime networks of the composite numbers: pseudo-randomness and synchronizability

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6559395)