On Decomposing Any Graph G into VDT Graphs

M. Sivasankari

doi:10.52783/cana.v31.1399

PDF

Published: Aug 23, 2024

DOI: https://doi.org/10.52783/cana.v31.1399

Keywords:

Decomposition, BFS, Tree, Domination.

M. Sivasankari, M. Yamuna

Abstract

This article targets to develop an iterative procedure for decomposing any random graph G into subgraphs such that each H_i is a VDT graph, 1 ≤ i ≤ k. This iterative technique is based on developing a rooted tree, and then decompose G into VDT graphs using backtracking.

Issue

Vol. 31 No. 7s (2024)

Section

Articles

Announcements

Call for Papers

Call for Papers for the Upcoming Issue.

Last Date of Submission: April 30^th, 2026

Call for Reviewers

Call for Editorial Member/ Reviewers Submitting your Application
If you would like to apply for the position of an Editorial Board Member on the journal, please contact the Editor including your CV and a brief covering letter detailing why you are a suitable candidate, to editor@internationalpubls.com. Your cover letter should be no longer than one page and should cover where you believe the research field is going (and the journal's place within it), as well as details of any previous relevant journal editorial and peer review management experience.