(mathematics) With reference to a graph G, a subgraph of G that contains all the vertices of G.
spanning subgraph
| Sci-Tech Dictionary: spanning subgraph |
(′span·iŋ ′səb′graf)
| 5min Related Video: spanning subgraph |
Learn More
 | factor |
| Minimum degree spanning tree |
| EMST |
 | What is col span and row span? Read answer... |
| What is a span of mules? Read answer... |
| What is a clear span? Read answer... |
Help us answer these
 | Solution to the proof if a graph has v equals 6 then G or the complement of G possibly both has a subgraph isomorphic to k 3? |
| What is the antonym of span? |
| What is span of managment? |
Post a question - any question - to the WikiAnswers community:
Copyrights:
 |
 | Sci-Tech 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 |
Related answers
- What is induced subgraph?
- How do you find subgraph in a graph?
- How many subgraphs with at least one vertex does w3 have?
- What is span?
ADVERTISEMENT
