✦ LIBER ✦

A Partition Method for Graph Isomorphism

✍ Scribed by Lijun Tian; Chaoqun Liu; Jianquan Xie

Book ID: 113847456
Publisher: Elsevier
Year: 2012
Tongue: English
Weight: 209 KB
Volume: 25
Category: Article
ISSN: 1875-3892
DOI: 10.1016/j.phpro.2012.03.308

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A method of determining graph isomorphis

A method of determining graph isomorphism

✍ V. K. Pogrebnoi 📂 Article 📅 1982 🏛 Springer US 🌐 English ⚖ 923 KB

A method for the recognition of graph is

A method for the recognition of graph isomorphism

✍ V. M. Kureichik; A. G. Korolev 📂 Article 📅 1977 🏛 Springer US 🌐 English ⚖ 613 KB

Partitioning a graph into two isomorphic

Partitioning a graph into two isomorphic pieces

✍ Anthony Bonato; Richard Nowakowski 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 137 KB

## Abstract A simple graph __G__ has the neighbour‐closed‐co‐neighbour property, or ncc property, if for all vertices __x__ of __G__, the subgraph induced by the set of neighbours of __x__ is isomorphic to the subgraph induced by the set of non‐neighbours of __x__. We present characterizations of g

Partitioning circulant graphs into isomo

Partitioning circulant graphs into isomorphic linear forests

✍ Hu Wenfeng; Wang Jianfang 📂 Article 📅 1999 🏛 Institute of Applied Mathematics, Chinese Academy 🌐 English ⚖ 275 KB

Decomposition of a Complete Multi-Partit

Decomposition of a Complete Multi-Partite Graph into Isomorphic Claws

✍ Tazawa, Shinsei 📂 Article 📅 1985 🏛 Society for Industrial and Applied Mathematics ⚖ 505 KB

Random Graph Isomorphism

✍ Babai, László; Erdo˝s, Paul; Selkow, Stanley M. 📂 Article 📅 1980 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 638 KB