{"id":"https://openalex.org/W3097858040","doi":"https://doi.org/10.1142/s1793830921500531","title":"Two-tree graphs with minimum sum-connectivity index","display_name":"Two-tree graphs with minimum sum-connectivity index","publication_year":2020,"publication_date":"2020-11-03","ids":{"openalex":"https://openalex.org/W3097858040","doi":"https://doi.org/10.1142/s1793830921500531","mag":"3097858040"},"language":"en","primary_location":{"id":"doi:10.1142/s1793830921500531","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s1793830921500531","pdf_url":null,"source":{"id":"https://openalex.org/S178434951","display_name":"Discrete Mathematics Algorithms and Applications","issn_l":"1793-8309","issn":["1793-8309","1793-8317"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Mathematics, Algorithms and Applications","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5029192127","display_name":"Akbar Jahanbani","orcid":"https://orcid.org/0000-0002-2800-4420"},"institutions":[{"id":"https://openalex.org/I51301133","display_name":"Azarbaijan Shahid Madani University","ror":"https://ror.org/05pg2cw06","country_code":"IR","type":"education","lineage":["https://openalex.org/I51301133"]}],"countries":["IR"],"is_corresponding":true,"raw_author_name":"A. Jahanbani","raw_affiliation_strings":["Department of Mathematics, Azarbaijan Shahid Madani University, Tabriz, I. R. Iran"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Azarbaijan Shahid Madani University, Tabriz, I. R. Iran","institution_ids":["https://openalex.org/I51301133"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5029192127"],"corresponding_institution_ids":["https://openalex.org/I51301133"],"apc_list":null,"apc_paid":null,"fwci":1.5407,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.827606,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":"13","issue":"05","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11476","display_name":"Graph theory and applications","score":0.9959999918937683,"subfield":{"id":"https://openalex.org/subfields/2608","display_name":"Geometry and Topology"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11476","display_name":"Graph theory and applications","score":0.9959999918937683,"subfield":{"id":"https://openalex.org/subfields/2608","display_name":"Geometry and Topology"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9955000281333923,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10083","display_name":"Graphene research and applications","score":0.9897000193595886,"subfield":{"id":"https://openalex.org/subfields/2505","display_name":"Materials Chemistry"},"field":{"id":"https://openalex.org/fields/25","display_name":"Materials Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8472017049789429},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.649551272392273},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6278311014175415},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.45187634229660034},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.43849965929985046},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.38032665848731995}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8472017049789429},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.649551272392273},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6278311014175415},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.45187634229660034},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.43849965929985046},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.38032665848731995},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s1793830921500531","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s1793830921500531","pdf_url":null,"source":{"id":"https://openalex.org/S178434951","display_name":"Discrete Mathematics Algorithms and Applications","issn_l":"1793-8309","issn":["1793-8309","1793-8317"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Mathematics, Algorithms and Applications","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W1993943561","https://openalex.org/W2008772272","https://openalex.org/W2013872122","https://openalex.org/W2018778266","https://openalex.org/W2020125634","https://openalex.org/W2066891982","https://openalex.org/W2084392972","https://openalex.org/W2086320116","https://openalex.org/W2116401597","https://openalex.org/W2947778687","https://openalex.org/W3102587357"],"related_works":["https://openalex.org/W2980963558","https://openalex.org/W2002282073","https://openalex.org/W1882246857","https://openalex.org/W3103304230","https://openalex.org/W2185360082","https://openalex.org/W1992365905","https://openalex.org/W4287664878","https://openalex.org/W3212023493","https://openalex.org/W2790190308","https://openalex.org/W4301046126"],"abstract_inverted_index":{"The":[0,55,63],"sum-connectivity":[1,117],"index":[2,118],"of":[3,14,25,40,97,119],"a":[4,88,101],"graph":[5,69],"[Formula:":[6,16,22,26,30,34,43,47,51,76,81,104],"see":[7,17,23,27,31,35,44,48,52,77,82,105],"text]":[8,18,24,32,36,45,49,78,106],"is":[9,66,84,121],"defined":[10,60],"as":[11],"the":[12,38,41,67,93,111,116,124,127,130],"sum":[13],"weights":[15],"over":[19],"all":[20],"edges":[21],"text],":[28,53],"where":[29],"and":[33,46,123,129],"are":[37,59,135],"degrees":[39],"vertices":[42,79,96],"in":[50,100],"respectively.":[54],"graphs":[56],"called":[57],"two-trees":[58,120,125],"by":[61,86],"recursion.":[62],"smallest":[64],"two-tree":[65,74,102],"complete":[68],"on":[70,75,103,115],"two":[71,94],"vertices.":[72,107],"A":[73],"(where":[80],"text])":[83],"obtained":[85],"adding":[87],"new":[89],"vertex":[90],"adjacent":[91],"to":[92],"end":[95],"one":[98],"edge":[99],"In":[108],"this":[109],"paper,":[110],"sharp":[112],"lower":[113],"bound":[114],"presented,":[122],"with":[126],"minimum":[128,132],"second":[131],"sum-connectivity,":[133],"respectively,":[134],"determined.":[136]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}