𝔖 Bobbio Scriptorium
✦   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

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


On the Super Edge-Magic Deficiency of Gr
✍ 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