{"id":"https://openalex.org/W4392865820","doi":"https://doi.org/10.1142/s1793830924500174","title":"Equitable path decomposition of graphs","display_name":"Equitable path decomposition of graphs","publication_year":2024,"publication_date":"2024-02-14","ids":{"openalex":"https://openalex.org/W4392865820","doi":"https://doi.org/10.1142/s1793830924500174"},"language":"en","primary_location":{"id":"doi:10.1142/s1793830924500174","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s1793830924500174","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/A5058291566","display_name":"I. Sahul Hamid","orcid":"https://orcid.org/0000-0001-7350-1920"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"I. Sahul Hamid","raw_affiliation_strings":["Department of Mathematics, The Madura College, Madurai 625011, India"],"raw_orcid":"https://orcid.org/0000-0001-7350-1920","affiliations":[{"raw_affiliation_string":"Department of Mathematics, The Madura College, Madurai 625011, India","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5094168227","display_name":"H. Shanmuga Priya","orcid":null},"institutions":[{"id":"https://openalex.org/I2802738084","display_name":"Fatima Mata National College","ror":"https://ror.org/02xyffp85","country_code":"IN","type":"education","lineage":["https://openalex.org/I2802738084"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"H. Shanmuga Priya","raw_affiliation_strings":["Department of Mathematics, Fatima College, Madurai 625018, India"],"raw_orcid":"https://orcid.org/0009-0002-8427-4887","affiliations":[{"raw_affiliation_string":"Department of Mathematics, Fatima College, Madurai 625018, India","institution_ids":["https://openalex.org/I2802738084"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5021257532","display_name":"S. Saravanakumar","orcid":null},"institutions":[{"id":"https://openalex.org/I15664174","display_name":"Madurai Medical College","ror":"https://ror.org/05ghahk68","country_code":"IN","type":"education","lineage":["https://openalex.org/I15664174"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"S. Saravanakumar","raw_affiliation_strings":["Department of Mathematics, Thiagarajar College of Engineering, Madurai 625015, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Thiagarajar College of Engineering, Madurai 625015, India","institution_ids":["https://openalex.org/I15664174"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.2173,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.47387433,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":95},"biblio":{"volume":"17","issue":"02","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T13991","display_name":"Nuclear Receptors and Signaling","score":0.9972000122070312,"subfield":{"id":"https://openalex.org/subfields/2804","display_name":"Cellular and Molecular Neuroscience"},"field":{"id":"https://openalex.org/fields/28","display_name":"Neuroscience"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},"topics":[{"id":"https://openalex.org/T13991","display_name":"Nuclear Receptors and Signaling","score":0.9972000122070312,"subfield":{"id":"https://openalex.org/subfields/2804","display_name":"Cellular and Molecular Neuroscience"},"field":{"id":"https://openalex.org/fields/28","display_name":"Neuroscience"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},{"id":"https://openalex.org/T11797","display_name":"graph theory and CDMA systems","score":0.9969000220298767,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9937999844551086,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/decomposition","display_name":"Decomposition","score":0.7596534490585327},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.6023001074790955},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5761598348617554},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.5360842943191528},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.49589404463768005},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.490474671125412},{"id":"https://openalex.org/keywords/induced-path","display_name":"Induced path","score":0.49013862013816833},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.471480131149292},{"id":"https://openalex.org/keywords/modular-decomposition","display_name":"Modular decomposition","score":0.41581130027770996},{"id":"https://openalex.org/keywords/disjoint-union","display_name":"Disjoint union (topology)","score":0.413308322429657},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.41011059284210205},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3994951844215393},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3770235478878021},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.2441137433052063},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.21825140714645386},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.19931179285049438},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.12328356504440308},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.06269234418869019},{"id":"https://openalex.org/keywords/chemistry","display_name":"Chemistry","score":0.053393781185150146}],"concepts":[{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.7596534490585327},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6023001074790955},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5761598348617554},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.5360842943191528},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.49589404463768005},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.490474671125412},{"id":"https://openalex.org/C58228413","wikidata":"https://www.wikidata.org/wiki/Q15704639","display_name":"Induced path","level":5,"score":0.49013862013816833},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.471480131149292},{"id":"https://openalex.org/C187407849","wikidata":"https://www.wikidata.org/wiki/Q6889712","display_name":"Modular decomposition","level":5,"score":0.41581130027770996},{"id":"https://openalex.org/C7655956","wikidata":"https://www.wikidata.org/wiki/Q5282259","display_name":"Disjoint union (topology)","level":2,"score":0.413308322429657},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.41011059284210205},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3994951844215393},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3770235478878021},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.2441137433052063},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.21825140714645386},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.19931179285049438},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.12328356504440308},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.06269234418869019},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.053393781185150146},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C178790620","wikidata":"https://www.wikidata.org/wiki/Q11351","display_name":"Organic chemistry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s1793830924500174","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s1793830924500174","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":[{"display_name":"Reduced inequalities","score":0.4300000071525574,"id":"https://metadata.un.org/sdg/10"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":2,"referenced_works":["https://openalex.org/W2016186662","https://openalex.org/W2487034343"],"related_works":["https://openalex.org/W55187247","https://openalex.org/W2058834578","https://openalex.org/W1891636518","https://openalex.org/W264408731","https://openalex.org/W2073363580","https://openalex.org/W411819533","https://openalex.org/W2067430117","https://openalex.org/W2004734763","https://openalex.org/W1972516737","https://openalex.org/W4247056703"],"abstract_inverted_index":{"A":[0,23],"decomposition":[1,24,50,54,67],"of":[2,8,20,26,45,49,55,78],"a":[3,6,33,43,46,56,66,97],"graph":[4,57],"is":[5,31,62],"collection":[7],"its":[9],"edge":[10,18],"\u2014":[11],"disjoint":[12],"subgraphs":[13],"whose":[14,27],"union":[15],"equals":[16],"the":[17,21,71,76],"set":[19],"graph.":[22],"all":[25,70],"members":[28,72],"are":[29,73,82],"paths":[30,74,81],"called":[32],"path":[34,53],"decomposition.":[35],"In":[36,92],"this":[37,93,100],"paper,":[38,94],"we":[39,95],"introduce":[40],"and":[41,75],"initiate":[42,96],"study":[44,98],"new":[47],"variation":[48],"namely":[51],"equitable":[52],"[Formula:":[58,89],"see":[59,90],"text]":[60],"which":[61,69],"defined":[63],"to":[64],"be":[65],"in":[68,88],"lengths":[77],"any":[79],"two":[80],"differ":[83],"by":[84],"at":[85],"most":[86],"one":[87],"text].":[91],"on":[99],"parameter.":[101]},"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}