{"id":"https://openalex.org/W4413109464","doi":"https://doi.org/10.1142/s0219265925500057","title":"A Note on Cycles Containing 4 Vertices and 2-Path in 3-Connected Cubic Graphs","display_name":"A Note on Cycles Containing 4 Vertices and 2-Path in 3-Connected Cubic Graphs","publication_year":2025,"publication_date":"2025-03-05","ids":{"openalex":"https://openalex.org/W4413109464","doi":"https://doi.org/10.1142/s0219265925500057"},"language":"en","primary_location":{"id":"doi:10.1142/s0219265925500057","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0219265925500057","pdf_url":null,"source":{"id":"https://openalex.org/S63112013","display_name":"Journal of Interconnection Networks","issn_l":"0219-2659","issn":["0219-2659","1793-6713"],"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":"Journal of Interconnection Networks","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/A5044032808","display_name":"Y. Li","orcid":null},"institutions":[{"id":"https://openalex.org/I9086337","display_name":"Taiyuan University of Technology","ror":"https://ror.org/03kv08d37","country_code":"CN","type":"education","lineage":["https://openalex.org/I9086337"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Yashu Li","raw_affiliation_strings":["Department of Mathematics, Taiyuan University of Technology, Taiyuan 030024, P. R. China"],"raw_orcid":"https://orcid.org/0009-0007-1714-8094","affiliations":[{"raw_affiliation_string":"Department of Mathematics, Taiyuan University of Technology, Taiyuan 030024, P. R. China","institution_ids":["https://openalex.org/I9086337"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5042668892","display_name":"Xia Li","orcid":"https://orcid.org/0000-0001-7584-6877"},"institutions":[{"id":"https://openalex.org/I9086337","display_name":"Taiyuan University of Technology","ror":"https://ror.org/03kv08d37","country_code":"CN","type":"education","lineage":["https://openalex.org/I9086337"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Xia Li","raw_affiliation_strings":["Department of Mathematics, Taiyuan University of Technology, Taiyuan 030024, P. R. China"],"raw_orcid":"https://orcid.org/0000-0001-7584-6877","affiliations":[{"raw_affiliation_string":"Department of Mathematics, Taiyuan University of Technology, Taiyuan 030024, P. R. China","institution_ids":["https://openalex.org/I9086337"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5063445370","display_name":"Weihua Yang","orcid":"https://orcid.org/0000-0002-3827-7334"},"institutions":[{"id":"https://openalex.org/I9086337","display_name":"Taiyuan University of Technology","ror":"https://ror.org/03kv08d37","country_code":"CN","type":"education","lineage":["https://openalex.org/I9086337"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Weihua Yang","raw_affiliation_strings":["Department of Mathematics, Taiyuan University of Technology, Taiyuan 030024, P. R. China"],"raw_orcid":"https://orcid.org/0000-0002-3827-7334","affiliations":[{"raw_affiliation_string":"Department of Mathematics, Taiyuan University of Technology, Taiyuan 030024, P. R. China","institution_ids":["https://openalex.org/I9086337"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5063445370"],"corresponding_institution_ids":["https://openalex.org/I9086337"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.20143738,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"26","issue":"02","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9984999895095825,"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"}},"topics":[{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9984999895095825,"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"}},{"id":"https://openalex.org/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.9918000102043152,"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"}},{"id":"https://openalex.org/T11797","display_name":"graph theory and CDMA systems","score":0.9847999811172485,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7687491178512573},{"id":"https://openalex.org/keywords/path-graph","display_name":"Path graph","score":0.6750698089599609},{"id":"https://openalex.org/keywords/cubic-graph","display_name":"Cubic graph","score":0.6636617183685303},{"id":"https://openalex.org/keywords/wheel-graph","display_name":"Wheel graph","score":0.5868276357650757},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5798611640930176},{"id":"https://openalex.org/keywords/distance","display_name":"Distance","score":0.47797033190727234},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4610632359981537},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.44377321004867554},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.41705119609832764},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.4010913372039795},{"id":"https://openalex.org/keywords/voltage-graph","display_name":"Voltage graph","score":0.2556607723236084},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2532873749732971},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.24356073141098022},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.11233395338058472}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7687491178512573},{"id":"https://openalex.org/C128067373","wikidata":"https://www.wikidata.org/wiki/Q1415372","display_name":"Path graph","level":5,"score":0.6750698089599609},{"id":"https://openalex.org/C100500283","wikidata":"https://www.wikidata.org/wiki/Q1374495","display_name":"Cubic graph","level":5,"score":0.6636617183685303},{"id":"https://openalex.org/C148364342","wikidata":"https://www.wikidata.org/wiki/Q948887","display_name":"Wheel graph","level":5,"score":0.5868276357650757},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5798611640930176},{"id":"https://openalex.org/C54385418","wikidata":"https://www.wikidata.org/wiki/Q2742711","display_name":"Distance","level":4,"score":0.47797033190727234},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4610632359981537},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.44377321004867554},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.41705119609832764},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.4010913372039795},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.2556607723236084},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2532873749732971},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.24356073141098022},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.11233395338058472},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s0219265925500057","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0219265925500057","pdf_url":null,"source":{"id":"https://openalex.org/S63112013","display_name":"Journal of Interconnection Networks","issn_l":"0219-2659","issn":["0219-2659","1793-6713"],"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":"Journal of Interconnection Networks","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G642981513","display_name":null,"funder_award_id":"12371356","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"}],"funders":[{"id":"https://openalex.org/F4320321001","display_name":"National Natural Science Foundation of China","ror":"https://ror.org/01h0zpd94"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W1484040084","https://openalex.org/W1985580131","https://openalex.org/W2000734658","https://openalex.org/W2047827029","https://openalex.org/W2050906361","https://openalex.org/W2057454583","https://openalex.org/W2064702321","https://openalex.org/W2328576205","https://openalex.org/W4366818590"],"related_works":["https://openalex.org/W2064737922","https://openalex.org/W2982283786","https://openalex.org/W2069626737","https://openalex.org/W2749040238","https://openalex.org/W2898116945","https://openalex.org/W2963498914","https://openalex.org/W4289363180","https://openalex.org/W4309222715","https://openalex.org/W1778198164","https://openalex.org/W2794508120"],"abstract_inverted_index":{"Finding":[0],"a":[1,11,14,32,61,69],"cycle":[2,33,62],"that":[3,24,53],"contains":[4,31,60],"certain":[5],"prescribed":[6,66],"vertices":[7,67],"or":[8],"edges":[9],"within":[10],"graph":[12,18,30,59],"is":[13,39,51,75],"classical":[15],"problem":[16],"in":[17],"theory.":[19],"It":[20],"has":[21],"been":[22],"established":[23],"every":[25,54],"[Formula:":[26,55,70],"see":[27,56,71],"text]-connected":[28,57],"cubic":[29,58],"through":[34,63],"any":[35,64],"nine":[36],"vertices,":[37],"which":[38],"referred":[40],"to":[41],"as":[42],"the":[43],"well-known":[44],"nine-point":[45],"theorem.":[46],"In":[47],"this":[48],"paper,":[49],"it":[50],"demonstrated":[52],"four":[65],"and":[68],"text]-path.":[72],"This":[73],"result":[74],"optimal.":[76]},"counts_by_year":[],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}