Contents

Journal of Combinatorial Mathematics and Combinatorial Computing

  • Research article

Critical Set of Caterpillar Graph for Secret Sharing Scheme

Chairul Imron1, Budi Setiyono2, R. Simanjuntak3, Edy T. Baskoro
1Mathematics Department ITS
2Mathematics Department ITB
3
  • Published: 31/05/2008

Abstract

We investigate the critical set of edge-magic labeling on caterpillar graphs and its application on secret sharing schemes. We construct a distribution scheme based on supervisory secret sharing schemes, which use the notion of critical sets to distribute the shares and reconstruct the key.

Keywords: Caterpillar graph, secret sharing scheme, edge-magic to- tal labeling, critical sets.
Information
Guidelines
CP Initiatives
Follow CP
Facebook X-twitter Linkedin

1970-2025 CP (Manitoba, Canada) unless otherwise stated.

Citation
Chairul Imron, Budi Setiyono, R. Simanjuntak, Edy T. Baskoro. Critical Set of Caterpillar Graph for Secret Sharing Scheme[J], Journal of Combinatorial Mathematics and Combinatorial Computing, Volume 065. 121-125. DOI: .