Eintrag weiter verarbeiten
Minimum eccentric connectivity index for graphs with fixed order and fixed number of pendant vertices
Gespeichert in:
| Zeitschriftentitel: | Yugoslav Journal of Operations Research |
|---|---|
| Personen und Körperschaften: | , , , |
| In: | Yugoslav Journal of Operations Research, 29, 2019, 2, S. 193-202 |
| Format: | E-Article |
| Sprache: | Englisch |
| veröffentlicht: |
National Library of Serbia
|
| Schlagwörter: |
| author_facet |
Devillez, Gauvain Hertz, Alain Mélot, Hadrien Hauweele, Pierre Devillez, Gauvain Hertz, Alain Mélot, Hadrien Hauweele, Pierre |
|---|---|
| author |
Devillez, Gauvain Hertz, Alain Mélot, Hadrien Hauweele, Pierre |
| spellingShingle |
Devillez, Gauvain Hertz, Alain Mélot, Hadrien Hauweele, Pierre Yugoslav Journal of Operations Research Minimum eccentric connectivity index for graphs with fixed order and fixed number of pendant vertices Management Science and Operations Research |
| author_sort |
devillez, gauvain |
| spelling |
Devillez, Gauvain Hertz, Alain Mélot, Hadrien Hauweele, Pierre 0354-0243 1820-743X National Library of Serbia Management Science and Operations Research http://dx.doi.org/10.2298/yjor181115010d <jats:p>The eccentric connectivity index of a connected graph G is the sum over all vertices v of the product dG(v)eG(v), where dG(v) is the degree of v in G and eG(v) is the maximum distance between v and any other vertex of G. We characterize, with a new elegant proof, those graphs which have the smallest eccentric connectivity index among all connected graphs of a given order n. Then, given two integers n and p with p ? n - 1, we characterize those graphs which have the smallest eccentric connectivity index among all connected graphs of order n with p pendant vertices.</jats:p> Minimum eccentric connectivity index for graphs with fixed order and fixed number of pendant vertices Yugoslav Journal of Operations Research |
| doi_str_mv |
10.2298/yjor181115010d |
| facet_avail |
Online Free |
| finc_class_facet |
Wirtschaftswissenschaften |
| format |
ElectronicArticle |
| fullrecord |
blob:ai-49-aHR0cDovL2R4LmRvaS5vcmcvMTAuMjI5OC95am9yMTgxMTE1MDEwZA |
| id |
ai-49-aHR0cDovL2R4LmRvaS5vcmcvMTAuMjI5OC95am9yMTgxMTE1MDEwZA |
| institution |
DE-D275 DE-Bn3 DE-Brt1 DE-Zwi2 DE-D161 DE-Gla1 DE-Zi4 DE-15 DE-Pl11 DE-Rs1 DE-105 DE-14 DE-Ch1 DE-L229 |
| imprint |
National Library of Serbia, 2019 |
| imprint_str_mv |
National Library of Serbia, 2019 |
| issn |
1820-743X 0354-0243 |
| issn_str_mv |
1820-743X 0354-0243 |
| language |
English |
| mega_collection |
National Library of Serbia (CrossRef) |
| match_str |
devillez2019minimumeccentricconnectivityindexforgraphswithfixedorderandfixednumberofpendantvertices |
| publishDateSort |
2019 |
| publisher |
National Library of Serbia |
| recordtype |
ai |
| record_format |
ai |
| series |
Yugoslav Journal of Operations Research |
| source_id |
49 |
| title |
Minimum eccentric connectivity index for graphs with fixed order and fixed number of pendant vertices |
| title_unstemmed |
Minimum eccentric connectivity index for graphs with fixed order and fixed number of pendant vertices |
| title_full |
Minimum eccentric connectivity index for graphs with fixed order and fixed number of pendant vertices |
| title_fullStr |
Minimum eccentric connectivity index for graphs with fixed order and fixed number of pendant vertices |
| title_full_unstemmed |
Minimum eccentric connectivity index for graphs with fixed order and fixed number of pendant vertices |
| title_short |
Minimum eccentric connectivity index for graphs with fixed order and fixed number of pendant vertices |
| title_sort |
minimum eccentric connectivity index for graphs with fixed order and fixed number of pendant vertices |
| topic |
Management Science and Operations Research |
| url |
http://dx.doi.org/10.2298/yjor181115010d |
| publishDate |
2019 |
| physical |
193-202 |
| description |
<jats:p>The eccentric connectivity index of a connected graph G is the sum over all vertices v of the product dG(v)eG(v), where dG(v) is the degree of v in G and eG(v) is the maximum distance between v and any other vertex of G. We characterize, with a new elegant proof, those graphs which have the smallest eccentric connectivity index among all connected graphs of a given order n. Then, given two integers n and p with p ? n - 1, we characterize those graphs which have the smallest eccentric connectivity index among all connected graphs of order n with p pendant vertices.</jats:p> |
| container_issue |
2 |
| container_start_page |
193 |
| container_title |
Yugoslav Journal of Operations Research |
| container_volume |
29 |
| format_de105 |
Article, E-Article |
| format_de14 |
Article, E-Article |
| format_de15 |
Article, E-Article |
| format_de520 |
Article, E-Article |
| format_de540 |
Article, E-Article |
| format_dech1 |
Article, E-Article |
| format_ded117 |
Article, E-Article |
| format_degla1 |
E-Article |
| format_del152 |
Buch |
| format_del189 |
Article, E-Article |
| format_dezi4 |
Article |
| format_dezwi2 |
Article, E-Article |
| format_finc |
Article, E-Article |
| format_nrw |
Article, E-Article |
| _version_ |
1792331072012288005 |
| geogr_code |
not assigned |
| last_indexed |
2024-03-01T13:35:09.038Z |
| geogr_code_person |
not assigned |
| openURL |
url_ver=Z39.88-2004&ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fvufind.svn.sourceforge.net%3Agenerator&rft.title=Minimum+eccentric+connectivity+index+for+graphs+with+fixed+order+and+fixed+number+of+pendant+vertices&rft.date=2019-01-01&genre=article&issn=1820-743X&volume=29&issue=2&spage=193&epage=202&pages=193-202&jtitle=Yugoslav+Journal+of+Operations+Research&atitle=Minimum+eccentric+connectivity+index+for+graphs+with+fixed+order+and+fixed+number+of+pendant+vertices&aulast=Hauweele&aufirst=Pierre&rft_id=info%3Adoi%2F10.2298%2Fyjor181115010d&rft.language%5B0%5D=eng |
| SOLR | |
| _version_ | 1792331072012288005 |
| author | Devillez, Gauvain, Hertz, Alain, Mélot, Hadrien, Hauweele, Pierre |
| author_facet | Devillez, Gauvain, Hertz, Alain, Mélot, Hadrien, Hauweele, Pierre, Devillez, Gauvain, Hertz, Alain, Mélot, Hadrien, Hauweele, Pierre |
| author_sort | devillez, gauvain |
| container_issue | 2 |
| container_start_page | 193 |
| container_title | Yugoslav Journal of Operations Research |
| container_volume | 29 |
| description | <jats:p>The eccentric connectivity index of a connected graph G is the sum over all vertices v of the product dG(v)eG(v), where dG(v) is the degree of v in G and eG(v) is the maximum distance between v and any other vertex of G. We characterize, with a new elegant proof, those graphs which have the smallest eccentric connectivity index among all connected graphs of a given order n. Then, given two integers n and p with p ? n - 1, we characterize those graphs which have the smallest eccentric connectivity index among all connected graphs of order n with p pendant vertices.</jats:p> |
| doi_str_mv | 10.2298/yjor181115010d |
| facet_avail | Online, Free |
| finc_class_facet | Wirtschaftswissenschaften |
| format | ElectronicArticle |
| format_de105 | Article, E-Article |
| format_de14 | Article, E-Article |
| format_de15 | Article, E-Article |
| format_de520 | Article, E-Article |
| format_de540 | Article, E-Article |
| format_dech1 | Article, E-Article |
| format_ded117 | Article, E-Article |
| format_degla1 | E-Article |
| format_del152 | Buch |
| format_del189 | Article, E-Article |
| format_dezi4 | Article |
| format_dezwi2 | Article, E-Article |
| format_finc | Article, E-Article |
| format_nrw | Article, E-Article |
| geogr_code | not assigned |
| geogr_code_person | not assigned |
| id | ai-49-aHR0cDovL2R4LmRvaS5vcmcvMTAuMjI5OC95am9yMTgxMTE1MDEwZA |
| imprint | National Library of Serbia, 2019 |
| imprint_str_mv | National Library of Serbia, 2019 |
| institution | DE-D275, DE-Bn3, DE-Brt1, DE-Zwi2, DE-D161, DE-Gla1, DE-Zi4, DE-15, DE-Pl11, DE-Rs1, DE-105, DE-14, DE-Ch1, DE-L229 |
| issn | 1820-743X, 0354-0243 |
| issn_str_mv | 1820-743X, 0354-0243 |
| language | English |
| last_indexed | 2024-03-01T13:35:09.038Z |
| match_str | devillez2019minimumeccentricconnectivityindexforgraphswithfixedorderandfixednumberofpendantvertices |
| mega_collection | National Library of Serbia (CrossRef) |
| physical | 193-202 |
| publishDate | 2019 |
| publishDateSort | 2019 |
| publisher | National Library of Serbia |
| record_format | ai |
| recordtype | ai |
| series | Yugoslav Journal of Operations Research |
| source_id | 49 |
| spelling | Devillez, Gauvain Hertz, Alain Mélot, Hadrien Hauweele, Pierre 0354-0243 1820-743X National Library of Serbia Management Science and Operations Research http://dx.doi.org/10.2298/yjor181115010d <jats:p>The eccentric connectivity index of a connected graph G is the sum over all vertices v of the product dG(v)eG(v), where dG(v) is the degree of v in G and eG(v) is the maximum distance between v and any other vertex of G. We characterize, with a new elegant proof, those graphs which have the smallest eccentric connectivity index among all connected graphs of a given order n. Then, given two integers n and p with p ? n - 1, we characterize those graphs which have the smallest eccentric connectivity index among all connected graphs of order n with p pendant vertices.</jats:p> Minimum eccentric connectivity index for graphs with fixed order and fixed number of pendant vertices Yugoslav Journal of Operations Research |
| spellingShingle | Devillez, Gauvain, Hertz, Alain, Mélot, Hadrien, Hauweele, Pierre, Yugoslav Journal of Operations Research, Minimum eccentric connectivity index for graphs with fixed order and fixed number of pendant vertices, Management Science and Operations Research |
| title | Minimum eccentric connectivity index for graphs with fixed order and fixed number of pendant vertices |
| title_full | Minimum eccentric connectivity index for graphs with fixed order and fixed number of pendant vertices |
| title_fullStr | Minimum eccentric connectivity index for graphs with fixed order and fixed number of pendant vertices |
| title_full_unstemmed | Minimum eccentric connectivity index for graphs with fixed order and fixed number of pendant vertices |
| title_short | Minimum eccentric connectivity index for graphs with fixed order and fixed number of pendant vertices |
| title_sort | minimum eccentric connectivity index for graphs with fixed order and fixed number of pendant vertices |
| title_unstemmed | Minimum eccentric connectivity index for graphs with fixed order and fixed number of pendant vertices |
| topic | Management Science and Operations Research |
| url | http://dx.doi.org/10.2298/yjor181115010d |