The following pages link to Secret sharing schemes on graphs (Q3531289):
Displaying 17 items.
- Secret-sharing schemes for very dense graphs (Q290386) (← links)
- On weak odd domination and graph-based quantum secret sharing (Q496043) (← links)
- Secret sharing schemes for graph-based prohibited structures (Q1125037) (← links)
- A general theory of sharing graphs (Q1575875) (← links)
- On the information rate of perfect secret sharing schemes (Q1894277) (← links)
- Exact information ratios for secret sharing on small graphs with girth at least 5 (Q2003345) (← links)
- Secret sharing schemes based on graphical codes (Q2016393) (← links)
- Secret sharing on the \(d\)-dimensional cube (Q2260799) (← links)
- On an infinite family of graphs with information ratio \(2 - 1/k\) (Q2390949) (← links)
- The optimal average information ratio of secret-sharing schemes for the access structures based on unicycle graphs and bipartite graphs (Q2410257) (← links)
- Percolation in the secrecy graph (Q2446856) (← links)
- The exact values of the optimal average information ratio of perfect secret-sharing schemes for tree-based access structures (Q2510652) (← links)
- Secret sharing on large girth graphs (Q2632835) (← links)
- Secret Sharing Schemes for Dense Forbidden Graphs (Q2827736) (← links)
- Perfect secret sharing scheme based on vertex domination set (Q3451391) (← links)
- (Q4550483) (← links)
- SECRET CODING TECHNIQUE ON SUNFLOWER GRAPHS WITH PRODUCT CORDIAL LABELING (Q5076083) (← links)