Splitting a graph by a given partition of the set of vertices based on the minimum weight of the induced trees

Fuente: arXiv
Saved in:
Bibliographic Details
Main Author: Buslov, V. A.
Format: Preprint
Published: 2025
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866911164684828672
author Buslov, V. A.
author_facet Buslov, V. A.
contents A method for considering a weighted directed graph with an accuracy of up to a given partition of the set of vertices is proposed. The resulting digraph (the splitting graph) does not contain arcs inside each partition element, and the arcs between the partition atoms are calculated in a special way taking into account the arcs of the original directed graph inside the atoms. This accounting is based on minimal trees defined on atoms. A study was made of what information about the original digraph is preserved in its splitting.
format Preprint
id arxiv_https___arxiv_org_abs_2507_11909
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Splitting a graph by a given partition of the set of vertices based on the minimum weight of the induced trees
Buslov, V. A.
Combinatorics
05C20 (Primary) 05C35 (Secondary)
G.2.2
A method for considering a weighted directed graph with an accuracy of up to a given partition of the set of vertices is proposed. The resulting digraph (the splitting graph) does not contain arcs inside each partition element, and the arcs between the partition atoms are calculated in a special way taking into account the arcs of the original directed graph inside the atoms. This accounting is based on minimal trees defined on atoms. A study was made of what information about the original digraph is preserved in its splitting.
title Splitting a graph by a given partition of the set of vertices based on the minimum weight of the induced trees
topic Combinatorics
05C20 (Primary) 05C35 (Secondary)
G.2.2
url https://arxiv.org/abs/2507.11909