Decomposition of $\lambda$- fold complete equipartite graphs into connected unicyclic bipartite graphs with eight edges

In this paper, we obtain necessary and sufficient conditions for the decomposition of $\lambda$-fold complete equipartite graphs into connected unicyclic bipartite graphs with eight edges.

Authors

Institutions

Publication Details

Journal
Hacettepe Journal of Mathematics and Statistics
Published
2025-06-24
DOI
https://doi.org/10.15672/hujms.1333681
Primary Topic
graph theory and CDMA systems
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Decomposition of $\lambda$- fold complete equipartite graphs into connected unicyclic bipartite graphs with eight edges

A. Muthusamy, S. Ganesamurthy, S. Duraimurugan
Hacettepe Journal of Mathematics and Statistics
graph theory and CDMA systems
article

Decomposition of $\lambda$- fold complete equipartite graphs into connected unicyclic bipartite graphs with eight edges

A. Muthusamy, S. Ganesamurthy, S. Duraimurugan
article en

Abstract

In this paper, we obtain necessary and sufficient conditions for the decomposition of $\lambda$-fold complete equipartite graphs into connected unicyclic bipartite graphs with eight edges.

Hacettepe Journal of Mathematics and StatisticsVol. 54(6)
Periyar University (IN), SRM Institute of Science and Technology (IN)
University Grants Commission
Openalex Percentile: Top 87%
graph theory and CDMA systems
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.