A novel approach for cyclic decompositions of balanced complete bipartite graphs into infinite graph classes
From MaRDI portal
Publication:2672548
DOI10.1155/2022/9308708zbMath1491.05161OpenAlexW4229070805MaRDI QIDQ2672548
S. S. Askar, Omar Bazighifan, A. El-Mesady
Publication date: 10 June 2022
Published in: Journal of Function Spaces (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2022/9308708
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- \(E\)-super vertex magic labelings of graphs
- Note on \(E\)-super vertex magic graphs
- Large sets of Hamilton cycle decompositions of complete bipartite graphs
- Decomposition of K//(m,n)(K*//(m,n)) into cycles (circuits) of length 2k
- Decomposition of \(K_{m,n}\) into short cycles
- A dynamic survey of graph labeling
- Decomposition of complete bipartite graphs into generalized prisms
- The star arboricity of graphs
- Star arboricity of graphs
- Decomposing various graphs into short even-length cycles
- Decomposition of \(K_{m, n}\) into 4-cycles and \(2t\)-cycles
- Decomposition of complete bipartite graphs into cycles of distinct even lengths
- Magic Graphs
- On the decomposition ofkn into complete bipartite graphs
- The biparticity of a graph
- Cycle decompositions V: Complete graphs into cycles of arbitrary lengths
- Cycle Decompositions of $K_{\lowercase{n,n}}-I$
