On Decomposing Any Graph G into VDT Graphs

This article targets to develop an iterative procedure for decomposing any random graph G into subgraphs such that each Hi 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.

Authors

Publication Details

Journal
Communications on Applied Nonlinear Analysis
Published
2024-08-23
DOI
https://doi.org/10.52783/cana.v31.1399
Primary Topic
Advanced Graph Theory Research
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

On Decomposing Any Graph G into VDT Graphs

M. Sivasankari
Communications on Applied Nonlinear Analysis
Advanced Graph Theory Research
article

On Decomposing Any Graph G into VDT Graphs

M. Sivasankari
article en

Abstract

This article targets to develop an iterative procedure for decomposing any random graph G into subgraphs such that each Hi 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.

Communications on Applied Nonlinear AnalysisVol. 31(7s)
Openalex Percentile: Top 82%
Advanced Graph Theory Research
DOIOpen Access PDFOpenAlex
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.

On Decomposing Any Graph G into VDT Graphs — M. Sivasankari · Communications on Applied Nonlinear Analysis (2024) | TGRS Research Map | TGRS