✦ LIBER ✦

On Graphs for Certain Polyhedral Groups

✍ Scribed by Q. Mushtaq; F. Shaheen

Publisher: Elsevier Science
Year: 1993
Tongue: English
Weight: 309 KB
Volume: 159
Category: Article
ISSN: 0021-8693
DOI: 10.1006/jabr.1993.1159

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On Certain C-Test Words for Free Groups

✍ Donghi Lee 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 207 KB

On the conjecture for certain Laplacian

On the conjecture for certain Laplacian integral spectrum of graphs

✍ Kinkar Ch. Das; Sang-Gu Lee; Gi-Sang Cheon 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 184 KB 👁 1 views

## Abstract Let __G__ be a simple graph of order __n__ with Laplacian spectrum {λ~__n__~, λ~__n__−1~, …, λ~1~} where 0=λ~__n__~≤λ~__n__−1~≤⋅≤λ~1~. If there exists a graph whose Laplacian spectrum is __S__={0, 1, …, __n__−1}, then we say that __S__ is Laplacian realizable. In 6, Fallat et al. posed

On certain Hamiltonian cycles in planar

On certain Hamiltonian cycles in planar graphs

✍ B�hme, T.; Harant, J.; Tk�?, M. 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 162 KB 👁 2 views

The problem is considered under which conditions a 4-connected planar or projective planar graph has a Hamiltonian cycle containing certain prescribed edges and missing certain forbidden edges. The results are applied to obtain novel lower bounds on the number of distinct Hamiltonian cycles that mus

On Hamilton cycles in certain planar gra

On Hamilton cycles in certain planar graphs

✍ Sanders, Daniel P. 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 586 KB

Let G be a 2-connected plane graph with outer cycle XG such that for every minimal vertex cut S of G with IS1 5 3, every component of G \ S contains a vertex of XG. A sufficient condition for G to be Hamiltonian is presented. This theorem generalizes both Tutte's theorem that every 4-connected plan

On Certain Elements of Free Groups

✍ S.V Ivanov 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 179 KB

Let F be a free group of finite rank m. It is proven that for every n G 2 there m Ž . Ž . Ž . is a non-trivial word w x , . . . , x such that if values w U , w V of n 1 n n n n n Ž . w x , . . . , x on two n-tuples U and V of elements of F are conjugate and n 1 n n n m non-trivial then these n-tuple

On self duality of pathwidth in polyhedr

On self duality of pathwidth in polyhedral graph embeddings

✍ Fedor V. Fomin; Dimitrios M. Thilikos 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 211 KB

## Abstract Let __G__ be a 3‐connected planar graph and __G__^\*^ be its dual. We show that the pathwidth of __G__^\*^ is at most 6 times the pathwidth of __G__. We prove this result by relating the pathwidth of a graph with the cut‐width of its medial graph and we extend it to bounded genus embedd