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.
Similar content being viewed by others
Article PDF
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
Comments
By submitting a comment you agree to abide by our Terms and Community Guidelines. If you find something abusive or that does not comply with our terms or guidelines please flag it as inappropriate.