✦ LIBER ✦

Harary's conjectures on integral sum graphs

✍ Scribed by Zhibo Chen

Publisher: Elsevier Science
Year: 1996
Tongue: English
Weight: 167 KB
Volume: 160
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(95)00163-q

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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 some conjectures on cubic 3-connected

On some conjectures on cubic 3-connected graphs

✍ Jean-Luc Fouquet; Henri Thuillier 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 969 KB

Our purpose is to consider the following conjectures: Conjecture 1 (Barneffe). . Every cubic 3-connected bipartite planar graph is Hamiltonian. Conjecture 2 (Jaeger). Every cubic cyclically 4-edge connected graph G has a cycle C such that G -V(C) is acyclic. Conjecture 3 (Jackson, Fleischner). Ever

Some basic observations on Kelly's conje

Some basic observations on Kelly's conjecture for graphs

✍ Bennet Manvel 📂 Article 📅 1974 🏛 Elsevier Science 🌐 English ⚖ 457 KB

Rao's conjecture on self-complementary g

Rao's conjecture on self-complementary graphs with K-factors

✍ Kiyoshi Ando 📂 Article 📅 1985 🏛 John Wiley and Sons 🌐 English ⚖ 106 KB

## Abstract Rao posed the following conjecture, “Let G be a self‐complementary graph of order __p__, π = (d~1~ … dp) be its degree sequence. Then G has a k‐factor if and only if π − k, = (d1 − k, … dP − k) is graphical.” We construct a family of counterexamples for this conjecture for every k ⩾ 3.

A remark on Mulder's conjecture about in

A remark on Mulder's conjecture about interval-regular graphs

✍ K. Nomura 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 184 KB

Let F be a connected graph. F is said to be interval-regular if I F~\_ l(u) uF(x )J =. i holds for all vertices u and x ~ Fi(u), i > 0. For u, v e F, let I (u, v) denote the set of all vertices on a shortest path connecting u, v. A subset W of V(F) is said to be convex if l(u,v) c W holds for each u

Counterexamples to faudree and schelp's

Counterexamples to faudree and schelp's conjecture on hamiltonian-connected graphs

✍ Carsten Thomassen 📂 Article 📅 1978 🏛 John Wiley and Sons 🌐 English ⚖ 291 KB

## Abstract Faudree and Schelp conjectured that for any two vertices __x, y__ in a Hamiltonian‐connected graph __G__ and for any integer __k__, where __n__/2 ⩽ __k__ ⩽ __n__ − 1, __G__ has a path of length __k__ connecting __x__ and __y__. However, we show in this paper that there are infinitely ma