Eulerian Cycle Decomposition Conjecture for the line graph of complete graphs Article Swipe
R. Rajarajachozhan
,
R. Sampathkumar
·
YOU?
·
· 2018
· Open Access
·
· DOI: https://doi.org/10.1016/j.akcej.2018.01.012
YOU?
·
· 2018
· Open Access
·
· DOI: https://doi.org/10.1016/j.akcej.2018.01.012
The Eulerian Cycle Decomposition Conjecture, by Chartrand, Jordon and Zhang, states that if the minimum number of odd cycles in a cycle decomposition of an Eulerian graph of size is the maximum number of odd cycles in such a cycle decomposition is and is an integer such that where and are of the same parity, then there is a cycle decomposition of with exactly odd cycles. This conjecture is verified for the line graph of the complete graph.
Related Topics
Concepts
Metadata
- Type
- article
- Language
- en
- Landing Page
- https://doi.org/10.1016/j.akcej.2018.01.012
- https://www.tandfonline.com/doi/pdf/10.1016/j.akcej.2018.01.012?needAccess=true
- OA Status
- gold
- Cited By
- 1
- References
- 5
- Related Works
- 10
- OpenAlex ID
- https://openalex.org/W2793107901
All OpenAlex metadata
Raw OpenAlex JSON
- OpenAlex ID
-
https://openalex.org/W2793107901Canonical identifier for this work in OpenAlex
- DOI
-
https://doi.org/10.1016/j.akcej.2018.01.012Digital Object Identifier
- Title
-
Eulerian Cycle Decomposition Conjecture for the line graph of complete graphsWork title
- Type
-
articleOpenAlex work type
- Language
-
enPrimary language
- Publication year
-
2018Year of publication
- Publication date
-
2018-02-01Full publication date if available
- Authors
-
R. Rajarajachozhan, R. SampathkumarList of authors in order
- Landing page
-
https://doi.org/10.1016/j.akcej.2018.01.012Publisher landing page
- PDF URL
-
https://www.tandfonline.com/doi/pdf/10.1016/j.akcej.2018.01.012?needAccess=trueDirect link to full text PDF
- Open access
-
YesWhether a free full text is available
- OA status
-
goldOpen access status per OpenAlex
- OA URL
-
https://www.tandfonline.com/doi/pdf/10.1016/j.akcej.2018.01.012?needAccess=trueDirect OA link when available
- Concepts
-
Mathematics, Eulerian path, Combinatorics, Conjecture, Graph, Cycle basis, Discrete mathematics, Decomposition, Line graph, Graph power, Pure mathematics, Chemistry, Lagrangian, Organic chemistryTop concepts (fields/topics) attached by OpenAlex
- Cited by
-
1Total citation count in OpenAlex
- Citations by year (recent)
-
2021: 1Per-year citation counts (last 5 years)
- References (count)
-
5Number of works referenced by this work
- Related works (count)
-
10Other works algorithmically related by OpenAlex
Full payload
| id | https://openalex.org/W2793107901 |
|---|---|
| doi | https://doi.org/10.1016/j.akcej.2018.01.012 |
| ids.doi | https://doi.org/10.1016/j.akcej.2018.01.012 |
| ids.mag | 2793107901 |
| ids.openalex | https://openalex.org/W2793107901 |
| fwci | 0.12275237 |
| type | article |
| title | Eulerian Cycle Decomposition Conjecture for the line graph of complete graphs |
| biblio.issue | 2 |
| biblio.volume | 16 |
| biblio.last_page | 162 |
| biblio.first_page | 158 |
| topics[0].id | https://openalex.org/T11797 |
| topics[0].field.id | https://openalex.org/fields/22 |
| topics[0].field.display_name | Engineering |
| topics[0].score | 0.9998000264167786 |
| topics[0].domain.id | https://openalex.org/domains/3 |
| topics[0].domain.display_name | Physical Sciences |
| topics[0].subfield.id | https://openalex.org/subfields/2208 |
| topics[0].subfield.display_name | Electrical and Electronic Engineering |
| topics[0].display_name | graph theory and CDMA systems |
| topics[1].id | https://openalex.org/T12541 |
| topics[1].field.id | https://openalex.org/fields/17 |
| topics[1].field.display_name | Computer Science |
| topics[1].score | 0.9943000078201294 |
| topics[1].domain.id | https://openalex.org/domains/3 |
| topics[1].domain.display_name | Physical Sciences |
| topics[1].subfield.id | https://openalex.org/subfields/1703 |
| topics[1].subfield.display_name | Computational Theory and Mathematics |
| topics[1].display_name | Graph Labeling and Dimension Problems |
| topics[2].id | https://openalex.org/T11329 |
| topics[2].field.id | https://openalex.org/fields/26 |
| topics[2].field.display_name | Mathematics |
| topics[2].score | 0.9708999991416931 |
| topics[2].domain.id | https://openalex.org/domains/3 |
| topics[2].domain.display_name | Physical Sciences |
| topics[2].subfield.id | https://openalex.org/subfields/2607 |
| topics[2].subfield.display_name | Discrete Mathematics and Combinatorics |
| topics[2].display_name | Limits and Structures in Graph Theory |
| funders[0].id | https://openalex.org/F4320320304 |
| funders[0].ror | https://ror.org/00s9v1h75 |
| funders[0].display_name | European Centre for Disease Prevention and Control |
| is_xpac | False |
| apc_list.value | 1000 |
| apc_list.currency | GBP |
| apc_list.value_usd | 1226 |
| apc_paid.value | 1000 |
| apc_paid.currency | GBP |
| apc_paid.value_usd | 1226 |
| concepts[0].id | https://openalex.org/C33923547 |
| concepts[0].level | 0 |
| concepts[0].score | 0.8322842121124268 |
| concepts[0].wikidata | https://www.wikidata.org/wiki/Q395 |
| concepts[0].display_name | Mathematics |
| concepts[1].id | https://openalex.org/C43058520 |
| concepts[1].level | 3 |
| concepts[1].score | 0.7898779511451721 |
| concepts[1].wikidata | https://www.wikidata.org/wiki/Q624580 |
| concepts[1].display_name | Eulerian path |
| concepts[2].id | https://openalex.org/C114614502 |
| concepts[2].level | 1 |
| concepts[2].score | 0.787689208984375 |
| concepts[2].wikidata | https://www.wikidata.org/wiki/Q76592 |
| concepts[2].display_name | Combinatorics |
| concepts[3].id | https://openalex.org/C2780990831 |
| concepts[3].level | 2 |
| concepts[3].score | 0.6126120686531067 |
| concepts[3].wikidata | https://www.wikidata.org/wiki/Q319141 |
| concepts[3].display_name | Conjecture |
| concepts[4].id | https://openalex.org/C132525143 |
| concepts[4].level | 2 |
| concepts[4].score | 0.5057864189147949 |
| concepts[4].wikidata | https://www.wikidata.org/wiki/Q141488 |
| concepts[4].display_name | Graph |
| concepts[5].id | https://openalex.org/C26752605 |
| concepts[5].level | 5 |
| concepts[5].score | 0.4850708544254303 |
| concepts[5].wikidata | https://www.wikidata.org/wiki/Q16766188 |
| concepts[5].display_name | Cycle basis |
| concepts[6].id | https://openalex.org/C118615104 |
| concepts[6].level | 1 |
| concepts[6].score | 0.47227203845977783 |
| concepts[6].wikidata | https://www.wikidata.org/wiki/Q121416 |
| concepts[6].display_name | Discrete mathematics |
| concepts[7].id | https://openalex.org/C124681953 |
| concepts[7].level | 2 |
| concepts[7].score | 0.41585391759872437 |
| concepts[7].wikidata | https://www.wikidata.org/wiki/Q339062 |
| concepts[7].display_name | Decomposition |
| concepts[8].id | https://openalex.org/C203776342 |
| concepts[8].level | 3 |
| concepts[8].score | 0.3996931314468384 |
| concepts[8].wikidata | https://www.wikidata.org/wiki/Q1378376 |
| concepts[8].display_name | Line graph |
| concepts[9].id | https://openalex.org/C149530733 |
| concepts[9].level | 4 |
| concepts[9].score | 0.16547942161560059 |
| concepts[9].wikidata | https://www.wikidata.org/wiki/Q5597091 |
| concepts[9].display_name | Graph power |
| concepts[10].id | https://openalex.org/C202444582 |
| concepts[10].level | 1 |
| concepts[10].score | 0.11465981602668762 |
| concepts[10].wikidata | https://www.wikidata.org/wiki/Q837863 |
| concepts[10].display_name | Pure mathematics |
| concepts[11].id | https://openalex.org/C185592680 |
| concepts[11].level | 0 |
| concepts[11].score | 0.07404616475105286 |
| concepts[11].wikidata | https://www.wikidata.org/wiki/Q2329 |
| concepts[11].display_name | Chemistry |
| concepts[12].id | https://openalex.org/C53469067 |
| concepts[12].level | 2 |
| concepts[12].score | 0.0 |
| concepts[12].wikidata | https://www.wikidata.org/wiki/Q505735 |
| concepts[12].display_name | Lagrangian |
| concepts[13].id | https://openalex.org/C178790620 |
| concepts[13].level | 1 |
| concepts[13].score | 0.0 |
| concepts[13].wikidata | https://www.wikidata.org/wiki/Q11351 |
| concepts[13].display_name | Organic chemistry |
| keywords[0].id | https://openalex.org/keywords/mathematics |
| keywords[0].score | 0.8322842121124268 |
| keywords[0].display_name | Mathematics |
| keywords[1].id | https://openalex.org/keywords/eulerian-path |
| keywords[1].score | 0.7898779511451721 |
| keywords[1].display_name | Eulerian path |
| keywords[2].id | https://openalex.org/keywords/combinatorics |
| keywords[2].score | 0.787689208984375 |
| keywords[2].display_name | Combinatorics |
| keywords[3].id | https://openalex.org/keywords/conjecture |
| keywords[3].score | 0.6126120686531067 |
| keywords[3].display_name | Conjecture |
| keywords[4].id | https://openalex.org/keywords/graph |
| keywords[4].score | 0.5057864189147949 |
| keywords[4].display_name | Graph |
| keywords[5].id | https://openalex.org/keywords/cycle-basis |
| keywords[5].score | 0.4850708544254303 |
| keywords[5].display_name | Cycle basis |
| keywords[6].id | https://openalex.org/keywords/discrete-mathematics |
| keywords[6].score | 0.47227203845977783 |
| keywords[6].display_name | Discrete mathematics |
| keywords[7].id | https://openalex.org/keywords/decomposition |
| keywords[7].score | 0.41585391759872437 |
| keywords[7].display_name | Decomposition |
| keywords[8].id | https://openalex.org/keywords/line-graph |
| keywords[8].score | 0.3996931314468384 |
| keywords[8].display_name | Line graph |
| keywords[9].id | https://openalex.org/keywords/graph-power |
| keywords[9].score | 0.16547942161560059 |
| keywords[9].display_name | Graph power |
| keywords[10].id | https://openalex.org/keywords/pure-mathematics |
| keywords[10].score | 0.11465981602668762 |
| keywords[10].display_name | Pure mathematics |
| keywords[11].id | https://openalex.org/keywords/chemistry |
| keywords[11].score | 0.07404616475105286 |
| keywords[11].display_name | Chemistry |
| language | en |
| locations[0].id | doi:10.1016/j.akcej.2018.01.012 |
| locations[0].is_oa | True |
| locations[0].source.id | https://openalex.org/S2764899362 |
| locations[0].source.issn | 0972-8600, 2543-3474 |
| locations[0].source.type | journal |
| locations[0].source.is_oa | True |
| locations[0].source.issn_l | 0972-8600 |
| locations[0].source.is_core | True |
| locations[0].source.is_in_doaj | True |
| locations[0].source.display_name | AKCE International Journal of Graphs and Combinatorics |
| locations[0].source.host_organization | https://openalex.org/P4310320990 |
| locations[0].source.host_organization_name | Elsevier BV |
| locations[0].source.host_organization_lineage | https://openalex.org/P4310320990 |
| locations[0].source.host_organization_lineage_names | Elsevier BV |
| locations[0].license | cc-by-nc-nd |
| locations[0].pdf_url | https://www.tandfonline.com/doi/pdf/10.1016/j.akcej.2018.01.012?needAccess=true |
| locations[0].version | publishedVersion |
| locations[0].raw_type | journal-article |
| locations[0].license_id | https://openalex.org/licenses/cc-by-nc-nd |
| locations[0].is_accepted | True |
| locations[0].is_published | True |
| locations[0].raw_source_name | AKCE International Journal of Graphs and Combinatorics |
| locations[0].landing_page_url | https://doi.org/10.1016/j.akcej.2018.01.012 |
| locations[1].id | pmh:oai:doaj.org/article:9da6f992767343be82e2b2955bab39f6 |
| locations[1].is_oa | True |
| locations[1].source.id | https://openalex.org/S4306401280 |
| locations[1].source.issn | |
| locations[1].source.type | repository |
| locations[1].source.is_oa | False |
| locations[1].source.issn_l | |
| locations[1].source.is_core | False |
| locations[1].source.is_in_doaj | False |
| locations[1].source.display_name | DOAJ (DOAJ: Directory of Open Access Journals) |
| locations[1].source.host_organization | |
| locations[1].source.host_organization_name | |
| locations[1].license | cc-by-sa |
| locations[1].pdf_url | |
| locations[1].version | submittedVersion |
| locations[1].raw_type | article |
| locations[1].license_id | https://openalex.org/licenses/cc-by-sa |
| locations[1].is_accepted | False |
| locations[1].is_published | False |
| locations[1].raw_source_name | AKCE International Journal of Graphs and Combinatorics, Vol 16, Iss 2, Pp 158-162 (2019) |
| locations[1].landing_page_url | https://doaj.org/article/9da6f992767343be82e2b2955bab39f6 |
| locations[2].id | pmh:oai:doaj.org/article:a85dd57e7ebf4798bcb5db473ecd484c |
| locations[2].is_oa | True |
| locations[2].source.id | https://openalex.org/S4306401280 |
| locations[2].source.issn | |
| locations[2].source.type | repository |
| locations[2].source.is_oa | False |
| locations[2].source.issn_l | |
| locations[2].source.is_core | False |
| locations[2].source.is_in_doaj | False |
| locations[2].source.display_name | DOAJ (DOAJ: Directory of Open Access Journals) |
| locations[2].source.host_organization | |
| locations[2].source.host_organization_name | |
| locations[2].license | cc-by-sa |
| locations[2].pdf_url | |
| locations[2].version | submittedVersion |
| locations[2].raw_type | article |
| locations[2].license_id | https://openalex.org/licenses/cc-by-sa |
| locations[2].is_accepted | False |
| locations[2].is_published | False |
| locations[2].raw_source_name | AKCE International Journal of Graphs and Combinatorics, Vol 16, Iss 2, Pp 158-162 (2019) |
| locations[2].landing_page_url | https://doaj.org/article/a85dd57e7ebf4798bcb5db473ecd484c |
| indexed_in | crossref, doaj |
| authorships[0].author.id | https://openalex.org/A5088738207 |
| authorships[0].author.orcid | |
| authorships[0].author.display_name | R. Rajarajachozhan |
| authorships[0].countries | IN |
| authorships[0].affiliations[0].institution_ids | https://openalex.org/I197081775 |
| authorships[0].affiliations[0].raw_affiliation_string | Department of Mathematics, Annamalai University Annamalainagar 608 002 India |
| authorships[0].institutions[0].id | https://openalex.org/I197081775 |
| authorships[0].institutions[0].ror | https://ror.org/01x24z140 |
| authorships[0].institutions[0].type | education |
| authorships[0].institutions[0].lineage | https://openalex.org/I197081775 |
| authorships[0].institutions[0].country_code | IN |
| authorships[0].institutions[0].display_name | Annamalai University |
| authorships[0].author_position | first |
| authorships[0].raw_author_name | R. Rajarajachozhan |
| authorships[0].is_corresponding | True |
| authorships[0].raw_affiliation_strings | Department of Mathematics, Annamalai University Annamalainagar 608 002 India |
| authorships[1].author.id | https://openalex.org/A5055962124 |
| authorships[1].author.orcid | |
| authorships[1].author.display_name | R. Sampathkumar |
| authorships[1].countries | IN |
| authorships[1].affiliations[0].institution_ids | https://openalex.org/I197081775 |
| authorships[1].affiliations[0].raw_affiliation_string | Mathematics Section, Faculty of Engineering and Technology, Annamalai University Annamalainagar 608 002 India |
| authorships[1].institutions[0].id | https://openalex.org/I197081775 |
| authorships[1].institutions[0].ror | https://ror.org/01x24z140 |
| authorships[1].institutions[0].type | education |
| authorships[1].institutions[0].lineage | https://openalex.org/I197081775 |
| authorships[1].institutions[0].country_code | IN |
| authorships[1].institutions[0].display_name | Annamalai University |
| authorships[1].author_position | last |
| authorships[1].raw_author_name | R. Sampathkumar |
| authorships[1].is_corresponding | False |
| authorships[1].raw_affiliation_strings | Mathematics Section, Faculty of Engineering and Technology, Annamalai University Annamalainagar 608 002 India |
| has_content.pdf | True |
| has_content.grobid_xml | True |
| is_paratext | False |
| open_access.is_oa | True |
| open_access.oa_url | https://www.tandfonline.com/doi/pdf/10.1016/j.akcej.2018.01.012?needAccess=true |
| open_access.oa_status | gold |
| open_access.any_repository_has_fulltext | False |
| created_date | 2025-10-10T00:00:00 |
| display_name | Eulerian Cycle Decomposition Conjecture for the line graph of complete graphs |
| has_fulltext | False |
| is_retracted | False |
| updated_date | 2025-11-06T03:46:38.306776 |
| primary_topic.id | https://openalex.org/T11797 |
| primary_topic.field.id | https://openalex.org/fields/22 |
| primary_topic.field.display_name | Engineering |
| primary_topic.score | 0.9998000264167786 |
| primary_topic.domain.id | https://openalex.org/domains/3 |
| primary_topic.domain.display_name | Physical Sciences |
| primary_topic.subfield.id | https://openalex.org/subfields/2208 |
| primary_topic.subfield.display_name | Electrical and Electronic Engineering |
| primary_topic.display_name | graph theory and CDMA systems |
| related_works | https://openalex.org/W2388830849, https://openalex.org/W2137952152, https://openalex.org/W1989244503, https://openalex.org/W2511389660, https://openalex.org/W2060069351, https://openalex.org/W2525639485, https://openalex.org/W1484680105, https://openalex.org/W1991917222, https://openalex.org/W1564168462, https://openalex.org/W2512030433 |
| cited_by_count | 1 |
| counts_by_year[0].year | 2021 |
| counts_by_year[0].cited_by_count | 1 |
| locations_count | 3 |
| best_oa_location.id | doi:10.1016/j.akcej.2018.01.012 |
| best_oa_location.is_oa | True |
| best_oa_location.source.id | https://openalex.org/S2764899362 |
| best_oa_location.source.issn | 0972-8600, 2543-3474 |
| best_oa_location.source.type | journal |
| best_oa_location.source.is_oa | True |
| best_oa_location.source.issn_l | 0972-8600 |
| best_oa_location.source.is_core | True |
| best_oa_location.source.is_in_doaj | True |
| best_oa_location.source.display_name | AKCE International Journal of Graphs and Combinatorics |
| best_oa_location.source.host_organization | https://openalex.org/P4310320990 |
| best_oa_location.source.host_organization_name | Elsevier BV |
| best_oa_location.source.host_organization_lineage | https://openalex.org/P4310320990 |
| best_oa_location.source.host_organization_lineage_names | Elsevier BV |
| best_oa_location.license | cc-by-nc-nd |
| best_oa_location.pdf_url | https://www.tandfonline.com/doi/pdf/10.1016/j.akcej.2018.01.012?needAccess=true |
| best_oa_location.version | publishedVersion |
| best_oa_location.raw_type | journal-article |
| best_oa_location.license_id | https://openalex.org/licenses/cc-by-nc-nd |
| best_oa_location.is_accepted | True |
| best_oa_location.is_published | True |
| best_oa_location.raw_source_name | AKCE International Journal of Graphs and Combinatorics |
| best_oa_location.landing_page_url | https://doi.org/10.1016/j.akcej.2018.01.012 |
| primary_location.id | doi:10.1016/j.akcej.2018.01.012 |
| primary_location.is_oa | True |
| primary_location.source.id | https://openalex.org/S2764899362 |
| primary_location.source.issn | 0972-8600, 2543-3474 |
| primary_location.source.type | journal |
| primary_location.source.is_oa | True |
| primary_location.source.issn_l | 0972-8600 |
| primary_location.source.is_core | True |
| primary_location.source.is_in_doaj | True |
| primary_location.source.display_name | AKCE International Journal of Graphs and Combinatorics |
| primary_location.source.host_organization | https://openalex.org/P4310320990 |
| primary_location.source.host_organization_name | Elsevier BV |
| primary_location.source.host_organization_lineage | https://openalex.org/P4310320990 |
| primary_location.source.host_organization_lineage_names | Elsevier BV |
| primary_location.license | cc-by-nc-nd |
| primary_location.pdf_url | https://www.tandfonline.com/doi/pdf/10.1016/j.akcej.2018.01.012?needAccess=true |
| primary_location.version | publishedVersion |
| primary_location.raw_type | journal-article |
| primary_location.license_id | https://openalex.org/licenses/cc-by-nc-nd |
| primary_location.is_accepted | True |
| primary_location.is_published | True |
| primary_location.raw_source_name | AKCE International Journal of Graphs and Combinatorics |
| primary_location.landing_page_url | https://doi.org/10.1016/j.akcej.2018.01.012 |
| publication_date | 2018-02-01 |
| publication_year | 2018 |
| referenced_works | https://openalex.org/W4244148219, https://openalex.org/W4210584084, https://openalex.org/W2102407078, https://openalex.org/W2047993061, https://openalex.org/W2612690775 |
| referenced_works_count | 5 |
| abstract_inverted_index.a | 20, 38, 58 |
| abstract_inverted_index.an | 24, 44 |
| abstract_inverted_index.by | 5 |
| abstract_inverted_index.if | 12 |
| abstract_inverted_index.in | 19, 36 |
| abstract_inverted_index.is | 29, 41, 43, 57, 68 |
| abstract_inverted_index.of | 16, 23, 27, 33, 51, 61, 74 |
| abstract_inverted_index.The | 0 |
| abstract_inverted_index.and | 8, 42, 49 |
| abstract_inverted_index.are | 50 |
| abstract_inverted_index.for | 70 |
| abstract_inverted_index.odd | 17, 34, 64 |
| abstract_inverted_index.the | 13, 30, 52, 71, 75 |
| abstract_inverted_index.This | 66 |
| abstract_inverted_index.line | 72 |
| abstract_inverted_index.same | 53 |
| abstract_inverted_index.size | 28 |
| abstract_inverted_index.such | 37, 46 |
| abstract_inverted_index.that | 11, 47 |
| abstract_inverted_index.then | 55 |
| abstract_inverted_index.with | 62 |
| abstract_inverted_index.Cycle | 2 |
| abstract_inverted_index.cycle | 21, 39, 59 |
| abstract_inverted_index.graph | 26, 73 |
| abstract_inverted_index.there | 56 |
| abstract_inverted_index.where | 48 |
| abstract_inverted_index.Jordon | 7 |
| abstract_inverted_index.Zhang, | 9 |
| abstract_inverted_index.cycles | 18, 35 |
| abstract_inverted_index.graph. | 77 |
| abstract_inverted_index.number | 15, 32 |
| abstract_inverted_index.states | 10 |
| abstract_inverted_index.cycles. | 65 |
| abstract_inverted_index.exactly | 63 |
| abstract_inverted_index.integer | 45 |
| abstract_inverted_index.maximum | 31 |
| abstract_inverted_index.minimum | 14 |
| abstract_inverted_index.parity, | 54 |
| abstract_inverted_index.Eulerian | 1, 25 |
| abstract_inverted_index.complete | 76 |
| abstract_inverted_index.verified | 69 |
| abstract_inverted_index.Chartrand, | 6 |
| abstract_inverted_index.conjecture | 67 |
| abstract_inverted_index.Conjecture, | 4 |
| abstract_inverted_index.Decomposition | 3 |
| abstract_inverted_index.decomposition | 22, 40, 60 |
| cited_by_percentile_year.max | 93 |
| cited_by_percentile_year.min | 89 |
| corresponding_author_ids | https://openalex.org/A5088738207 |
| countries_distinct_count | 1 |
| institutions_distinct_count | 2 |
| corresponding_institution_ids | https://openalex.org/I197081775 |
| citation_normalized_percentile.value | 0.45725737 |
| citation_normalized_percentile.is_in_top_1_percent | False |
| citation_normalized_percentile.is_in_top_10_percent | False |