✦ LIBER ✦

On the k-edge magic graphs

✍ Scribed by Alikhani, Saeid; Kocay, William; Lau, Gee-Choon; Lee, Sin-Min

Book ID: 122236345
Publisher: Elsevier Science
Year: 2014
Tongue: English
Weight: 351 KB
Volume: 45
Category: Article
ISSN: 1571-0653
DOI: 10.1016/j.endm.2013.11.008

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Magic Graphs || Edge-Magic Total Labelin

Magic Graphs || Edge-Magic Total Labelings

✍ Marr, Alison M.; Wallis, W.D. 📂 Article 📅 2012 🏛 Springer New York ⚖ 693 KB

On the Super Edge-Magic Deficiency of Gr

On the Super Edge-Magic Deficiency of Graphs

✍ R.M. Figueroa-Centeno; R. Ichishima; F.A. Muntaner-Batle 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 514 KB

On k-edge-ordered graphs

✍ Denis Chebikin 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 259 KB

Super Edge Least-Magic Graphs

✍ S.M. Hegde; Sudhakar Shetty 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 91 KB

Minimally (k, k)-edge-connected graphs

✍ Kamal Hennayake; Hong-Jian Lai; Deying Li; Jingzhong Mao 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 138 KB 👁 1 views

## Abstract For an integer __l__ > 1, the __l__‐edge‐connectivity of a connected graph with at least __l__ vertices is the smallest number of edges whose removal results in a graph with __l__ components. A connected graph __G__ is (__k__, __l__)‐edge‐connected if the __l__‐edge‐connectivity of __G_

On k-minimally n-edge-connected graphs

✍ Stephen B. Maurer; Peter J. Slater 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 815 KB