2023
DOI: 10.3390/a16070320
|View full text |Cite
|
Sign up to set email alerts
|

On Orthogonal Double Covers and Decompositions of Complete Bipartite Graphs by Caterpillar Graphs

Abstract: Nowadays, graph theory is one of the most exciting fields of mathematics due to the tremendous developments in modern technology, where it is used in many important applications. The orthogonal double cover (ODC) is a branch of graph theory and is considered as a special class of graph decomposition. In this paper, we decompose the complete bipartite graphs Kx,x by caterpillar graphs using the method of ODCs. The article also deals with constructing the ODCs of Kx,x by general symmetric starter vectors of cate… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
0
0

Year Published

2024
2024
2024
2024

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 53 publications
0
0
0
Order By: Relevance
“…The interest in graph decompositions is motivated by several applications in many areas of mathematics, as well as in other disciplines, including computer science and social science. The significance of graph decompositions is well-explained in [3].…”
Section: Introductionmentioning
confidence: 99%
“…The interest in graph decompositions is motivated by several applications in many areas of mathematics, as well as in other disciplines, including computer science and social science. The significance of graph decompositions is well-explained in [3].…”
Section: Introductionmentioning
confidence: 99%