Abstract
LET the operation M, applied to a graph G, have the effect of removing from G all lines which are not members of at least one K3 (a complete graph or sub-graph having three points, that is, a triangle). The new graph MG consists entirely of triangles, and it will be unchanged by a second application of the operator M. M2G = MG.
This is a preview of subscription content, access via your institution
Access options
Subscribe to this journal
Receive 51 print issues and online access
$199.00 per year
only $3.90 per issue
Buy this article
- Purchase on SpringerLink
- Instant access to the full article PDF.
USD 39.95
Prices may be subject to local taxes which are calculated during checkout
Similar content being viewed by others
References
Rosenblatt, D., Naval Res. Logist. Quart., 4, 151 (1957).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
MEETHAM, A. Algorithm to assist in finding the Complete Sub-graphs of a Given Graph. Nature 211, 105 (1966). https://doi.org/10.1038/211105a0
Issue date:
DOI: https://doi.org/10.1038/211105a0
