Decomposing Weighted Graphs | Zendy

Ban Amir | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Premium

Decomposing Weighted Graphs

Author(s) -

Ban Amir

Publication year - 2017

Publication title -

journal of graph theory

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 1.164

H-Index - 54

eISSN - 1097-0118

pISSN - 0364-9024

DOI - 10.1002/jgt.22124

Subject(s) - combinatorics , mathematics , vertex (graph theory) , graph , undirected graph , enhanced data rates for gsm evolution , discrete mathematics , computer science , telecommunications

We solve the following problem: Can an undirected weighted graph G be partitioned into two nonempty induced subgraphs satisfying minimum constraints for the sum of edge weights at vertices of each subgraph? We show that this is possible for all constraints a ( x ) , b ( x ) satisfyingd G ( x ) ≥ a ( x ) + b ( x ) + 2 W G ( x ) , for every vertex x , whered G ( x ) , W G ( x )are, respectively, the sum and maximum of incident edge weights.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here

Accelerating Research