Computer search for trees with minimal ABC index

The ABC index is a degree-based molecular structure descriptor, that found chemical applications. Finding the connected graph(s) of a given order whose ABC index is minimal is a hitherto unsolved problem, but it is known that these must be trees. In this paper, by combining mathematical arguments an...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Applied mathematics and computation 2012-10, Vol.219 (2), p.767-772
Hauptverfasser:	Furtula, Boris, Gutman, Ivan, Ivanović, Miloš, Vukičević, Damir
Format:	Artikel
Sprache:	eng
Schlagworte:	Computation Computer simulation Mathematical models Molecular structure Searching Trees
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

container_end_page	772
container_issue	2
container_start_page	767
container_title	Applied mathematics and computation
container_volume	219
creator	Furtula, Boris Gutman, Ivan Ivanović, Miloš Vukičević, Damir
description	The ABC index is a degree-based molecular structure descriptor, that found chemical applications. Finding the connected graph(s) of a given order whose ABC index is minimal is a hitherto unsolved problem, but it is known that these must be trees. In this paper, by combining mathematical arguments and computer-based modeling we establish the basic structural features of the minimum-ABC trees.
doi_str_mv	10.1016/j.amc.2012.06.075
format	Article
fullrecord	<record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_1082216829</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>1082216829</sourcerecordid><originalsourceid>FETCH-LOGICAL-c278t-2b6635c0e353f965920e4bc38f41043ce2e848d26fddc97de9e04bfdffed6ff23</originalsourceid><addsrcrecordid>eNot0DtPwzAUhmEPIFEKP4DNI0vC8SWOPZaIm1SJBWYrsY_VRLlhpwL-PanKdJZXR58eQu4Y5AyYeujyenA5B8ZzUDmUxQXZABiVCQBxRa5T6gCgVExuCFTTMB8XjDRhHd2BhinSJSIm-t0uBzq0YzvUPd09VrQdPf7ckMtQ9wlv_--WfD4_fVSv2f795a3a7TPHS71kvFFKFA5QFCIYVRgOKBsndJAMpHDIUUvtuQreO1N6NAiyCT4E9CoELrbk_vx3jtPXEdNihzY57Pt6xOmYLAPNOVOamzVl59TFKaWIwc5xHR1_18ieRGxnVxF7ErGg7Coi_gCFn1ZO</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1082216829</pqid></control><display><type>article</type><title>Computer search for trees with minimal ABC index</title><source>Elsevier ScienceDirect Journals</source><creator>Furtula, Boris ; Gutman, Ivan ; Ivanović, Miloš ; Vukičević, Damir</creator><creatorcontrib>Furtula, Boris ; Gutman, Ivan ; Ivanović, Miloš ; Vukičević, Damir</creatorcontrib><description>The ABC index is a degree-based molecular structure descriptor, that found chemical applications. Finding the connected graph(s) of a given order whose ABC index is minimal is a hitherto unsolved problem, but it is known that these must be trees. In this paper, by combining mathematical arguments and computer-based modeling we establish the basic structural features of the minimum-ABC trees.</description><identifier>ISSN: 0096-3003</identifier><identifier>DOI: 10.1016/j.amc.2012.06.075</identifier><language>eng</language><subject>Computation ; Computer simulation ; Mathematical models ; Molecular structure ; Searching ; Trees</subject><ispartof>Applied mathematics and computation, 2012-10, Vol.219 (2), p.767-772</ispartof><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c278t-2b6635c0e353f965920e4bc38f41043ce2e848d26fddc97de9e04bfdffed6ff23</citedby><cites>FETCH-LOGICAL-c278t-2b6635c0e353f965920e4bc38f41043ce2e848d26fddc97de9e04bfdffed6ff23</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,776,780,27901,27902</link.rule.ids></links><search><creatorcontrib>Furtula, Boris</creatorcontrib><creatorcontrib>Gutman, Ivan</creatorcontrib><creatorcontrib>Ivanović, Miloš</creatorcontrib><creatorcontrib>Vukičević, Damir</creatorcontrib><title>Computer search for trees with minimal ABC index</title><title>Applied mathematics and computation</title><description>The ABC index is a degree-based molecular structure descriptor, that found chemical applications. Finding the connected graph(s) of a given order whose ABC index is minimal is a hitherto unsolved problem, but it is known that these must be trees. In this paper, by combining mathematical arguments and computer-based modeling we establish the basic structural features of the minimum-ABC trees.</description><subject>Computation</subject><subject>Computer simulation</subject><subject>Mathematical models</subject><subject>Molecular structure</subject><subject>Searching</subject><subject>Trees</subject><issn>0096-3003</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2012</creationdate><recordtype>article</recordtype><recordid>eNot0DtPwzAUhmEPIFEKP4DNI0vC8SWOPZaIm1SJBWYrsY_VRLlhpwL-PanKdJZXR58eQu4Y5AyYeujyenA5B8ZzUDmUxQXZABiVCQBxRa5T6gCgVExuCFTTMB8XjDRhHd2BhinSJSIm-t0uBzq0YzvUPd09VrQdPf7ckMtQ9wlv_--WfD4_fVSv2f795a3a7TPHS71kvFFKFA5QFCIYVRgOKBsndJAMpHDIUUvtuQreO1N6NAiyCT4E9CoELrbk_vx3jtPXEdNihzY57Pt6xOmYLAPNOVOamzVl59TFKaWIwc5xHR1_18ieRGxnVxF7ErGg7Coi_gCFn1ZO</recordid><startdate>201210</startdate><enddate>201210</enddate><creator>Furtula, Boris</creator><creator>Gutman, Ivan</creator><creator>Ivanović, Miloš</creator><creator>Vukičević, Damir</creator><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>7TB</scope><scope>8FD</scope><scope>FR3</scope><scope>JQ2</scope><scope>KR7</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>201210</creationdate><title>Computer search for trees with minimal ABC index</title><author>Furtula, Boris ; Gutman, Ivan ; Ivanović, Miloš ; Vukičević, Damir</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c278t-2b6635c0e353f965920e4bc38f41043ce2e848d26fddc97de9e04bfdffed6ff23</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2012</creationdate><topic>Computation</topic><topic>Computer simulation</topic><topic>Mathematical models</topic><topic>Molecular structure</topic><topic>Searching</topic><topic>Trees</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Furtula, Boris</creatorcontrib><creatorcontrib>Gutman, Ivan</creatorcontrib><creatorcontrib>Ivanović, Miloš</creatorcontrib><creatorcontrib>Vukičević, Damir</creatorcontrib><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Mechanical & Transportation Engineering Abstracts</collection><collection>Technology Research Database</collection><collection>Engineering Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Civil Engineering Abstracts</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>Applied mathematics and computation</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Furtula, Boris</au><au>Gutman, Ivan</au><au>Ivanović, Miloš</au><au>Vukičević, Damir</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Computer search for trees with minimal ABC index</atitle><jtitle>Applied mathematics and computation</jtitle><date>2012-10</date><risdate>2012</risdate><volume>219</volume><issue>2</issue><spage>767</spage><epage>772</epage><pages>767-772</pages><issn>0096-3003</issn><abstract>The ABC index is a degree-based molecular structure descriptor, that found chemical applications. Finding the connected graph(s) of a given order whose ABC index is minimal is a hitherto unsolved problem, but it is known that these must be trees. In this paper, by combining mathematical arguments and computer-based modeling we establish the basic structural features of the minimum-ABC trees.</abstract><doi>10.1016/j.amc.2012.06.075</doi><tpages>6</tpages></addata></record>
fulltext	fulltext
identifier	ISSN: 0096-3003
ispartof	Applied mathematics and computation, 2012-10, Vol.219 (2), p.767-772
issn	0096-3003
language	eng
recordid	cdi_proquest_miscellaneous_1082216829
source	Elsevier ScienceDirect Journals
subjects	Computation Computer simulation Mathematical models Molecular structure Searching Trees
title	Computer search for trees with minimal ABC index
url	https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-28T18%3A13%3A21IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Computer%20search%20for%20trees%20with%20minimal%20ABC%20index&rft.jtitle=Applied%20mathematics%20and%20computation&rft.au=Furtula,%20Boris&rft.date=2012-10&rft.volume=219&rft.issue=2&rft.spage=767&rft.epage=772&rft.pages=767-772&rft.issn=0096-3003&rft_id=info:doi/10.1016/j.amc.2012.06.075&rft_dat=%3Cproquest_cross%3E1082216829%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=1082216829&rft_id=info:pmid/&rfr_iscdi=true