The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

Displaying similar documents to “The total graph of a module”

Toughness of K a , t -minor-free graphs.

Chen, Guantao, Egawa, Yoshimi, Kawarabayashi, Ken-ichi, Mohar, Bojan, Ota, Katsuhiro (2011)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Simple Graphs as Simplicial Complexes: the Mycielskian of a Graph

Piotr Rudnicki, Lorna Stewart (2012)

Formalized Mathematics

Similarity:

Harary [10, p. 7] claims that Veblen [20, p. 2] first suggested to formalize simple graphs using simplicial complexes. We have developed basic terminology for simple graphs as at most 1-dimensional complexes. We formalize this new setting and then reprove Mycielski’s [12] construction resulting in a triangle-free graph with arbitrarily large chromatic number. A different formalization of similar material is in [15].

Z-modules

Yuichi Futa, Hiroyuki Okazaki, Yasunari Shidama (2012)

Formalized Mathematics

Similarity:

In this article, we formalize Z-module, that is a module over integer ring. Z-module is necassary for lattice problems, LLL (Lenstra-Lenstra-Lovász) base reduction algorithm and cryptographic systems with lattices [11].

Derived graphs of some graphs

Sudhir R. Jog, Satish P. Hande, Ivan Gutman, S. Burcu Bozkurt (2012)

Kragujevac Journal of Mathematics

Similarity: