- Title
- Visual cryptography scheme for graphs with vertex covering number two
- Creator
- Arumugam, S.; Lakshmanan, R.; Nagar, A.K.
- Relation
- National Academy Science Letters Vol. 36, Issue 6, p. 575-579
- Publisher Link
- http://dx.doi.org/10.1007/s40009-013-0171-x
- Publisher
- National Academy of Sciences
- Resource Type
- journal article
- Date
- 2013
- Description
- Let G = (V, E) be a graph without isolated vertices. Let m*(G) denote the optimal pixel expansion of a visual cryptography scheme for the strong access structure Γ(G) on V whose basis is E. In this paper we determine m*(G) for any connected graph G with vertex covering number two.
- Subject
- independent set; vertex covering number; visual cryptography scheme; pixel expansion; relative contrast
- Identifier
- http://hdl.handle.net/1959.13/1341828
- Identifier
- uon:28824
- Identifier
- ISSN:0250-541X
- Language
- eng
- Reviewed
- Hits: 1342
- Visitors: 1420
- Downloads: 0
| Thumbnail | File | Description | Size | Format |
|---|