Journal of Information Processing
Online ISSN : 1882-6652
ISSN-L : 1882-6652
Transforming Graphs with the Same Graphic Sequence
Sergey BeregHiro Ito
Author information
JOURNAL FREE ACCESS

2017 Volume 25 Pages 627-633

Details
Abstract

Let G and H be two graphs with the same vertex set V. It is well known that a graph G can be transformed into a graph H by a sequence of 2-switches if and only if every vertex of V has the same degree in both G and H. We study the problem of finding the minimum number of 2-switches for transforming G into H.

Content from these authors
© 2017 by the Information Processing Society of Japan
Previous article Next article
feedback
Top