{"doi":"10.5614/ejgta.2021.9.2.21","title":"Embedding complete multi-partite graphs into Cartesian product of paths and cycles","abstract":null,"journal":"Electronic Journal of Graph Theory and Applications","year":2021,"id":597602,"datarank":0.16479184330021646,"base_score":1.0986122886681096,"endowment":1.0986122886681096,"self_citation_contribution":0.16479184330021646,"citation_network_contribution":0.0,"self_endowment_contribution":0.16479184330021646,"citer_contribution":0.0,"corpus_percentile":null,"corpus_rank":null,"citation_count":2,"citer_count":0,"citers_with_citation_signal":0,"citers_with_endowment":0,"datacite_reuse_total":0,"is_dataset":false,"is_dataset_confidence":null,"is_data_producer":false,"deposit_databanks":null,"is_oa":false,"file_count":0,"downloads":0,"has_version_chain":false,"published_date":null,"fair_score":null,"fair_percentile":null,"algorithm_id":"datarank_citation_only_1hop_v6","ranking_scope":"data_only","authors":[{"id":1531009,"name":"A. Arul Shantrinal","orcid":"0000-0002-1706-0742","position":1,"is_corresponding":false},{"id":1531010,"name":"T.M. Rajalaxmi","orcid":"0000-0001-9700-8110","position":2,"is_corresponding":false},{"id":1531011,"name":"Jianxi Fan","orcid":"0000-0002-7055-5891","position":3,"is_corresponding":false},{"id":1531012,"name":"Weibei Fan","orcid":"0000-0003-1255-5815","position":4,"is_corresponding":false},{"id":1531008,"name":"R. Sundara Rajan","orcid":"0000-0002-1851-6334","position":0,"is_corresponding":false}],"reference_count":0,"raw_metadata":{"has_enrichment":true,"resolved":true,"title":"Embedding complete multi-partite graphs into Cartesian product of paths and cycles","abstract":"Graph embedding is a powerful method in parallel computing that maps a guest network G into a host network H . The performance of an embedding can be evaluated by certain parameters, such as the dilation, the edge congestion, and the wirelength. In this manuscript, we obtain the wirelength (exact and minimum) of embedding complete multi-partite graphs into Cartesian product of paths and/or cycles, which include n -cube, n -dimensional mesh (grid), n -dimensional cylinder, and n -dimensional torus, etc., as the subfamilies.","is_dataset_classified":null,"base_score":1.0986122886681096,"endowment":1.0986122886681096,"datacite_reuse_total":0,"file_count":0,"downloads":0,"views":0,"has_version_chain":false,"is_dataset":false,"is_oa":false,"pmid":"23304386","pmcid":null,"openalex_id":"https://openalex.org/W3206528106","authors":[],"funders":[],"total_grants":0,"fwci":0.1299,"citation_percentile":0.53231041,"influential_citations":0,"citation_trend":[{"year":2021,"count":1},{"year":2026,"count":1}],"oa_status":"gold","license":"cc-by-sa","oa_locations":[{"url":"https://www.ejgta.org/index.php/ejgta/article/download/937/pdf_196","host_type":"journal"},{"url":"https://www.ejgta.org/index.php/ejgta/article/download/937/pdf_196","host_type":"publisher"},{"url":"https://www.ejgta.org/index.php/ejgta/article/viewFile/937/pdf_196","host_type":"publisher"},{"url":"https://doi.org/10.5614/ejgta.2021.9.2.21","host_type":"journal"},{"url":"https://doaj.org/article/d4ba5fc50ad04f8f97c0cce630ba0975","host_type":"repository"}],"fields_of_study":["Interconnection Networks and Systems","Advanced Optical Network Technologies","Advanced Graph Theory Research"],"mesh_terms":[],"keywords":["Cartesian product","Embedding","Graph embedding","Torus","Dilation (metric space)","Grid","Grid network","Product (mathematics)","Computer science","Graph","Mathematics","Combinatorics","Discrete mathematics","Topology (electrical circuits)","Geometry"],"sdg_mappings":[{"sdg_number":0,"sdg_label":"Sustainable cities and communities"}],"linked_datasets":[],"clinical_trials":[],"software_tools":[],"database_accessions":[],"source":"live","citation_network_status":"fetched"},"created_at":"2026-07-28T13:44:32.217033Z","pmid":null,"pmcid":null,"fwci":null,"citation_percentile":null,"influential_citations":0,"oa_status":null,"license":null,"views":0,"total_file_size_bytes":0,"version_count":0,"fair_f":null,"fair_a":null,"fair_i":null,"fair_r":null,"fair_zscore":null,"fair_rationale":null,"fair_model":null,"fair_agent_version":null,"fair_fulltext_source":null,"fair_has_llm":null,"fair_computed_at":null,"clinical_trials":[],"software_tools":[],"db_accessions":[],"linked_datasets":[],"topics":[]}