Optimal secret share distribution in degree splitting communication networks
From MaRDI portal
Publication:6186165
DOI10.3934/nhm.2023075OpenAlexW4387623140MaRDI QIDQ6186165
Raúl M. Falcón, Venkitachalam Aparna, Nagaraj Mohanapriya
Publication date: 2 February 2024
Published in: Networks and Heterogeneous Media (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/nhm.2023075
Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph theory (including graph drawing) in computer science (68R10) Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Authentication, digital signatures and secret sharing (94A62)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the difference between chromatic number and dynamic chromatic number of graphs
- Spread of (mis)information in social networks
- Dynamic chromatic number of regular graphs
- Complexity of conditional colorability of graphs
- On the \(r\)-dynamic coloring of subdivision-edge coronas of a path
- On the \(r\)-dynamic coloring of the direct product of a path with either a complete graph or a wheel graph
- Improving lower bounds for equitable chromatic number
- Graph \(r\)-hued colorings -- a survey
- A variant of the Power-Arnoldi algorithm for computing PageRank
- Optimally connected hybrid complex networks with windmill graphs backbone
- On dynamic coloring of certain cycle-related graphs
- Finding a dense-core in jellyfish graphs
- Conditional colorings of graphs
- Decomposition of communication networks
- Concentration of rainbow \(k\)-connectivity of a multiplex random graph
- A survey of graph coloring - its types, methods and applications
- How to share a secret
- Graph colorings with local constraints -- a survey
- Dynamic choosability of triangle‐free graphs and sparse random graphs
- Guide to Graph Colouring
- On r− dynamic coloring of the gear graph families
- Integrity of total transformation graphs
- On the r-dynamic coloring of some fan graph families
This page was built for publication: Optimal secret share distribution in degree splitting communication networks
