3.6k views

The number of spanning trees for a complete graph with seven vertices is

1. $2^5$
2. $7^5$
3. $3^5$
4. $2^{2 \times 5}$
| 3.6k views
0
+1
Why did we assume that the complete graph with seven vertices is labeled? Am I missing anything?

No of spanning tree possible in complete graph with n node=nn-2

So No of spanning tree possible in complete graph with 7 node=75

spanning tree possible in complete graph

by Boss (38.7k points)
selected
0
correct

Number of spanning tree in complete graph have k vertex==K^K-2

Ex::

K=7

No. of spanning tree possible is=7^7-2=7^5

Option B will be right option

by Boss (10.2k points)
+1 vote
Number of Spanning trees in Complete Graph of N vertices = N^(N-2)

According to Question:

N=7

So number of spanning trees will be = 7^(7-2)

= 7 ^ 5
by Boss (42.4k points)

The number of spanning trees in the complete graph Kn is nn-2

by Boss (13.8k points)
{"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 1, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "url": "https://gateoverflow.in/48555/isro2015-41", "fetch_time": 1579922442000000000, "content_mime_type": "text/html", "warc_filename": "crawl-data/CC-MAIN-2020-05/segments/1579250628549.43/warc/CC-MAIN-20200125011232-20200125040232-00298.warc.gz", "warc_record_offset": 445952940, "warc_record_length": 17693, "token_count": 283, "char_count": 907, "score": 4.0, "int_score": 4, "crawl": "CC-MAIN-2020-05", "snapshot_type": "latest", "language": "en", "language_score": 0.8526214361190796, "file_path": "/sailhome/yjruan/project/latent-lm/data/processed/finemath-4plus/finemath-4plus/train-00029-of-00064.parquet"}