Commensurability of graph products.
Januszkiewicz, Tadeusz, Świa̧tkowski, Jacek (2001)
Algebraic & Geometric Topology
Similarity:
Januszkiewicz, Tadeusz, Świa̧tkowski, Jacek (2001)
Algebraic & Geometric Topology
Similarity:
Bruno Zimmermann (1998)
Rendiconti del Seminario Matematico della Università di Padova
Similarity:
Exoo, Geoffrey (2002)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Girse, Robert D. (1986)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Anton Kundrík (1990)
Mathematica Slovaca
Similarity:
C. S., Jr. Johnson, Frederick R. McMorris (1982)
Mathematica Slovaca
Similarity:
Manju K. Menon, A. Vijayakumar (2010)
Discussiones Mathematicae Graph Theory
Similarity:
The edge C₄ graph of a graph G, E₄(G) is a graph whose vertices are the edges of G and two vertices in E₄(G) are adjacent if the corresponding edges in G are either incident or are opposite edges of some C₄. In this paper, we show that there exist infinitely many pairs of non isomorphic graphs whose edge C₄ graphs are isomorphic. We study the relationship between the diameter, radius and domination number of G and those of E₄(G). It is shown that for any graph G without isolated vertices,...
Al-Addasi, Salah, Al-Ezeh, Hasan (2008)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Broderick Arneson, Piotr Rudnicki (2006)
Formalized Mathematics
Similarity:
We are formalizing the algorithm for recognizing chordal graphs by lexicographic breadth-first search as presented in [13, Section 3 of Chapter 4, pp. 81-84]. Then we follow with a formalization of another algorithm serving the same end but based on maximum cardinality search as presented by Tarjan and Yannakakis [25].This work is a part of the MSc work of the first author under supervision of the second author. We would like to thank one of the anonymous reviewers for very useful suggestions. ...