On average edge length of minimum spanning trees
This paper presents a theorem that asserts that average edge length of the minimum spanning tree of a complete graph on n+1 vertices is less than or equal to the average edge length of all the n+1 minimum spanning trees of the induced graph on n vertices. The result is also in compliance with result...
Saved in:
| Published in | Information processing letters Vol. 70; no. 5; pp. 241 - 243 |
|---|---|
| Main Authors | , , |
| Format | Journal Article |
| Language | English |
| Published |
Amsterdam
Elsevier B.V
21.06.1999
Elsevier Science Elsevier Sequoia S.A |
| Subjects | |
| Online Access | Get full text |
Cover
Loading…
| Abstract | This paper presents a theorem that asserts that average edge length of the minimum spanning tree of a complete graph on
n+1 vertices is less than or equal to the average edge length of all the
n+1 minimum spanning trees of the induced graph on n vertices. The result is also in compliance with results given by Frieze and Steele. |
|---|---|
| AbstractList | A theorem is presented that asserts that average edge length of the minimum spanning tree of a complete graph on n + 1 vertices is less than or equal to the average edge length of all the n + 1 minimum spanning trees of the induced graph on n vertices. The result is in compliance with results given by Frieze (1985) and Steele (1987). This paper presents a theorem that asserts that average edge length of the minimum spanning tree of a complete graph on n+1 vertices is less than or equal to the average edge length of all the n+1 minimum spanning trees of the induced graph on n vertices. The result is also in compliance with results given by Frieze and Steele. |
| Author | Chowdhury, Rezaul Alam Nath, Suman Kumar Kaykobad, M. |
| Author_xml | – sequence: 1 givenname: Suman Kumar surname: Nath fullname: Nath, Suman Kumar email: sknath@bdonline.com – sequence: 2 givenname: Rezaul Alam surname: Chowdhury fullname: Chowdhury, Rezaul Alam email: shaikat@bdonline.com – sequence: 3 givenname: M. surname: Kaykobad fullname: Kaykobad, M. email: kaykobad@buet.edu |
| BackLink | http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=1923612$$DView record in Pascal Francis |
| BookMark | eNqFkE1LAzEQhoNUsFZ_grCIBz2s5mOzSU4ixS8o9KBCbyFNZmtKN1uTbcF_725b9Ohl5vK87zDPKRqEJgBCFwTfEkzKuzeMKc4xUfhaqRuMcSnz2REaEiloXhKiBmj4i5yg05SWPVQwMUR4GjKzhWgWkIHrxgrCov3MmiqrffD1ps7S2oTgwyJrI0A6Q8eVWSU4P-wR-nh6fB-_5JPp8-v4YZJbRkibS0csZ8AVE1Qp5wh33AkjTEkKToEzN-eCGFcSaRifF4IC40qKAhdWGi7YCF3ue9ex-dpAavWy2cTQndS065RSsB66OkAmWbOqognWJ72OvjbxWxNFWUloh_E9ZmOTUoTqj8C6V6h3CnXvRyuldwr1rMvd73PQPbr1EHWyHoIF5yPYVrvG_9PwA7nkd2o |
| CODEN | IFPLAT |
| ContentType | Journal Article |
| Copyright | 1999 Elsevier Science B.V. 1999 INIST-CNRS Copyright Elsevier Sequoia S.A. Jun 21, 1999 |
| Copyright_xml | – notice: 1999 Elsevier Science B.V. – notice: 1999 INIST-CNRS – notice: Copyright Elsevier Sequoia S.A. Jun 21, 1999 |
| DBID | AAYXX CITATION IQODW 7SC 8FD JQ2 L7M L~C L~D |
| DOI | 10.1016/S0020-0190(99)00068-X |
| DatabaseName | CrossRef Pascal-Francis Computer and Information Systems Abstracts Technology Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional |
| DatabaseTitle | CrossRef Computer and Information Systems Abstracts Technology Research Database Computer and Information Systems Abstracts – Academic Advanced Technologies Database with Aerospace ProQuest Computer Science Collection Computer and Information Systems Abstracts Professional |
| DatabaseTitleList | Computer and Information Systems Abstracts |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science Applied Sciences |
| EISSN | 1872-6119 |
| EndPage | 243 |
| ExternalDocumentID | 44233042 1923612 10_1016_S0020_0190_99_00068_X S002001909900068X |
| GroupedDBID | --K --M -~X .DC .~1 0R~ 1B1 1RT 1~. 1~5 29I 4.4 457 4G. 5GY 5VS 7-5 71M 8P~ 9JN AACTN AAEDT AAEDW AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AAQXK AAXUO AAYFN ABBOA ABEFU ABFNM ABFSI ABJNI ABMAC ABTAH ABXDB ABYKQ ACDAQ ACGFS ACNNM ACRLP ACZNC ADBBV ADEZE ADJOM ADMUD AEBSH AEKER AENEX AFKWA AFTJW AGHFR AGUBO AGYEJ AHHHB AHZHX AIALX AIEXJ AIKHN AITUG AJBFU AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD ASPBG AVWKF AXJTR AZFZN BKOJK BKOMP BLXMC CS3 DU5 E.L EBS EFJIC EFLBG EJD EO8 EO9 EP2 EP3 F5P FDB FEDTE FGOYB FIRID FNPLU FYGXN G-2 G-Q G8K GBLVA GBOLZ HLZ HMJ HVGLF HZ~ IHE J1W KOM LG9 M26 M41 MO0 MS~ O-L O9- OAUVE OZT P-8 P-9 P2P PC. PQQKQ Q38 R2- RIG ROL RPZ SBC SDF SDG SDP SES SEW SME SPC SPCBC SSV SSZ T5K TN5 UQL WH7 WUQ XPP ZMT ZY4 ~G- AATTM AAXKI AAYWO AAYXX ABDPE ABWVN ACRPL ACVFH ADCNI ADNMO AEIPS AEUPX AFJKZ AFPUW AFXIZ AGCQF AGQPQ AGRNS AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP BNPGV CITATION SSH EFKBS IQODW 7SC 8FD JQ2 L7M L~C L~D |
| ID | FETCH-LOGICAL-c311t-8d1c53e5937299dd15d5d7a7a61452e53db571ad618a35b472e35987404c8a573 |
| IEDL.DBID | AIKHN |
| ISSN | 0020-0190 |
| IngestDate | Fri Jul 25 04:46:38 EDT 2025 Mon Jul 21 09:11:17 EDT 2025 Tue Jul 01 01:14:14 EDT 2025 Fri Feb 23 02:28:02 EST 2024 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 5 |
| Keywords | Complete graph Average edge length Minimum spanning tree Edge(graph) Graph theory Tree(graph) Spanning tree |
| Language | English |
| License | https://www.elsevier.com/tdm/userlicense/1.0 CC BY 4.0 |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c311t-8d1c53e5937299dd15d5d7a7a61452e53db571ad618a35b472e35987404c8a573 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 content type line 14 |
| PQID | 237288737 |
| PQPubID | 45522 |
| PageCount | 3 |
| ParticipantIDs | proquest_journals_237288737 pascalfrancis_primary_1923612 crossref_primary_10_1016_S0020_0190_99_00068_X elsevier_sciencedirect_doi_10_1016_S0020_0190_99_00068_X |
| ProviderPackageCode | CITATION AAYXX |
| PublicationCentury | 1900 |
| PublicationDate | 1999-06-21 |
| PublicationDateYYYYMMDD | 1999-06-21 |
| PublicationDate_xml | – month: 06 year: 1999 text: 1999-06-21 day: 21 |
| PublicationDecade | 1990 |
| PublicationPlace | Amsterdam |
| PublicationPlace_xml | – name: Amsterdam |
| PublicationTitle | Information processing letters |
| PublicationYear | 1999 |
| Publisher | Elsevier B.V Elsevier Science Elsevier Sequoia S.A |
| Publisher_xml | – name: Elsevier B.V – name: Elsevier Science – name: Elsevier Sequoia S.A |
| SSID | ssj0006437 |
| Score | 1.5141107 |
| Snippet | This paper presents a theorem that asserts that average edge length of the minimum spanning tree of a complete graph on
n+1 vertices is less than or equal to... A theorem is presented that asserts that average edge length of the minimum spanning tree of a complete graph on n + 1 vertices is less than or equal to the... |
| SourceID | proquest pascalfrancis crossref elsevier |
| SourceType | Aggregation Database Index Database Publisher |
| StartPage | 241 |
| SubjectTerms | Applied sciences Average edge length Complete graph Computer science; control theory; systems Exact sciences and technology Graphs Information processing Information retrieval. Graph Minimum spanning tree Studies Theoretical computing |
| Title | On average edge length of minimum spanning trees |
| URI | https://dx.doi.org/10.1016/S0020-0190(99)00068-X https://www.proquest.com/docview/237288737 |
| Volume | 70 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3NS8MwFH-4eRHEb3HqRg4e9FBdvtrmOIZjKurFQW_htelwh3XD1at_u0mbOkRE8FYCTcIvL7_3yPsCuFAqQmMVT2AMywIhMA0Qp_ZrKjgyJVUmXYLz41M4noj7RCYbMGxyYVxYpef-mtMrtvYjNx7Nm-Vs5nJ8XTyQcp4dl-iQtGCTcRVa0d4c3D2Mn74I2fmm6kgPF4Ol-utEnnqSavBSqatqniD5TUVtL3FlgZvWHS9-kHelkUZ7sONNSTKod7sPG3lxALtNmwbib-0h9J8LglZiLXMQ93pGXPOU8pUspsQVFpm_z4mllap1EXE-6tURTEa3L8Nx4BslBBmntAxiQzPJc6mcD04ZQ6WRJsIIre6VLJfcpDKiaEIaI5epiFjuCvdFoi-yGGXEj6FdLIr8BIjgaRhTjEWK1tbIUfUNFQZFJkUmYoYduG6w0cu6HoZeB4pZMLUDUyulKzB10oG4QVB_O1htOfuvX7vfEF8vqFzJGNaBs-YEtL95K80sBpY4eXT6_4XPYMtXZwgYPYd2-faed63tUaY9aF1_0J6XsE8Kp9H1 |
| linkProvider | Elsevier |
| linkToHtml | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1LS8NAEB5qPSiIb7HW6h486CG1m-w22aMUS9W2XlrIbZlkU-yhD2x69be7kweliAjewkJ2w7c73yyZb2YA7pTy0VjH4xjjxo4QGDmIE_s0ER66SqpYUoLzYNjujcVrKMMKdMpcGJJVFtyfc3rG1sXIY4Hm43I6pRxf0gMpiuxQokO4A7vCmi9ZZ_Nro_OgyFSu8yAFlmpt0njyKbLBe6Ueslmc8DcHdbDElYVtkve7-EHdmT_qHsNhcZFkT_m3nkAlmZ_CUdmkgRU2ewat9zlDe14tbzD6d8aodUr6wRYTRmVFZusZs6SSNS5iFKFencO4-zzq9JyiTYITe5ynTmB4LL1EKorAKWO4NNL46KP1vNJNpGci6XM0bR6gJyPhuwmV7fNFS8QBSt-7gOp8MU8ugQkvagccAxGhvWkkqFqGC4MiliIWgYs1aJbY6GVeDUNvZGIWTE1gaqV0BqYOaxCUCOqtbdWWsf96tbGF-GZBRQVj3BrUyx3Qhd2ttGsxsLTp-Vf_X_gW9nqjQV_3X4Zvddgv6jQ4Lr-Gavq5Thr2FpJGN9kp-watx9K5 |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=On+average+edge+length+of+minimum+spanning+trees&rft.jtitle=Information+processing+letters&rft.au=Nath%2C+Suman+Kumar&rft.au=Chowdhury%2C+Rezaul+Alam&rft.au=Kaykobad%2C+M.&rft.date=1999-06-21&rft.issn=0020-0190&rft.volume=70&rft.issue=5&rft.spage=241&rft.epage=243&rft_id=info:doi/10.1016%2FS0020-0190%2899%2900068-X&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_S0020_0190_99_00068_X |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0020-0190&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0020-0190&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0020-0190&client=summon |