n-connected graph
McGraw-Hill Science & Technology Dictionary:
Top
n-connected graph
(′en kə′nek·təd ′graf)
(mathematics) A connected graph for which the removal of n points is required to disconnect the graph.
Post a question - any question - to the WikiAnswers community:
Copyrights:
McGraw-Hill Science & Technology Dictionary
McGraw-Hill Dictionary of Scientific and Technical Terms. Copyright © 2003, 1994, 1989, 1984, 1978, 1976, 1974 by McGraw-Hill Companies, Inc. All rights reserved.
Read more