๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

On deciding switching equivalence of graphs

โœ Scribed by Charles J. Colbourn; Derek G. Corneil

Book ID
104182608
Publisher
Elsevier Science
Year
1980
Tongue
English
Weight
501 KB
Volume
2
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

On ?-equivalence and ?-equivalence of gr
On ?-equivalence and ?-equivalence of graphs
โœ Du, Qingyan ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 336 KB ๐Ÿ‘ 1 views

W e define a partial ordering on the set of a-polynomials as well as a vertex splitting operation on the set of graphs, and introduce the notions of (r-equivalence and (r- uniqueness of graphs. Let a ( G ) be the a-polynomial of a graph G and a ( G ) = (r(GC). Let H = (G, u , A, 5) be a vertex spli

Connected graphs switching equivalent to
Connected graphs switching equivalent to their iterated line graphs
โœ B. Devadas Acharya ๐Ÿ“‚ Article ๐Ÿ“… 1982 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 660 KB

## Dedlcared m my father on his 64th birthday of In this paper, the problem of determining graphs which are switching cqulvaknt to at least their iterated lme graphs is considered, and such connected graphs are characterized.

Decidability of Split Equivalence
Decidability of Split Equivalence
โœ Y. Abramson; A. Rabinovich ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 247 KB
Switching classes of directed graphs and
Switching classes of directed graphs and H-equivalent matrices
โœ Ying Cheng ๐Ÿ“‚ Article ๐Ÿ“… 1986 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 781 KB

In this paper, we define and study the switching classes of directed graphs. The definition is a generalization of both Van Lint and Seidel's switching classes of graphs and Cameron's switching classes of tournaments. We actually do it in a general way so that Wells" signed switching classes of grap