𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Characterization of( {mathbb{A}_{16}} )by a noncommuting graph

✍ Scribed by M. R. Darafsheh; M. Davoudi Monfared

Publisher
Springer
Year
2011
Tongue
English
Weight
253 KB
Volume
62
Category
Article
ISSN
0041-5995

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A proof of a circle graph characterizati
A proof of a circle graph characterization
✍ Emmanuel Gasse πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 266 KB

A circle graph is an intersection graph of a non-empty finite set of chords of a circle. By using a theorem of Bouchet, we redemonstrate easily a result obtained by Naji which characterizes circle graphs by resolving a system of linear equations of GF(2). The graphs that we consider are simple. A g

A characterization of Seymour graphs
A characterization of Seymour graphs
✍ Ageev, A. A.; Kostochka, A. V.; Szigeti, Z. πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 105 KB πŸ‘ 1 views

A connected undirected graph G is called a Seymour graph if the maximum number of edge disjoint T -cuts is equal to the cardinality of a minimum T -join for every even subset T of V (G). Several families of graphs have been shown to be subfamilies of Seymour graphs (Seymour

A characterization of ptolemaic graphs
A characterization of ptolemaic graphs
✍ Edward Howorka πŸ“‚ Article πŸ“… 1981 πŸ› John Wiley and Sons 🌐 English βš– 466 KB

A connected graph G is ptolernaic provided that for each four vertices u,, 1 5 i 5 4, of G, the six distances d, =dG (u,ui), i f j satisfy the inequality d,2d34 5 d,3d24 + d,4d23 (shown by Ptolemy t o hold in Euclidean spaces). Ptolemaic graphs were first investigated by Chartrand and Kay, who showe