𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Super–edge–graceful Labelings of Some Cubic Graphs

✍ Scribed by Wai Chee Shiu

Publisher
Institute of Mathematics, Chinese Academy of Sciences and Chinese Mathematical Society
Year
2006
Tongue
English
Weight
190 KB
Volume
22
Category
Article
ISSN
1439-7617

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Transformations of edge-coloured cubic g
Transformations of edge-coloured cubic graphs
✍ Yasuyuki Tsukui 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 491 KB

For a simple 3-edge-coloured cubic graph, an edge-c-reduction and three transformations (S-, X-, and H-transformation) are defined. Each transformation preserves order and regularity of graphs. They also define metrics on the set of all (connected) 3-edge-coloured cubic graphs with the same order. A

Super edge connectivity properties of co
Super edge connectivity properties of connected edge symmetric graphs
✍ Li, Qiaoliang; Li, Qiao 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 47 KB 👁 2 views

The super edge connectivity properties of a graph G can be measured by the restricted edge connectivity Ј(G). We evaluate Ј(G) and the number of i-cutsets C i (G), d Յ i Յ 2d Ϫ 3, explicitly for each d-regular edge-symmetric graph G. These results improve the previous one by R. Tindell on the same s

Optimal acyclic edge-coloring of cubic g
Optimal acyclic edge-coloring of cubic graphs
✍ Lars Døvling Andersen; Edita Máčajová;; Ján Mazák 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 194 KB

An __acyclic edge‐coloring__ of a graph is a proper edge‐coloring such that the subgraph induced by the edges of any two colors is acyclic. The __acyclic chromatic index__ of a graph __G__ is the smallest number of colors in an acyclic edge‐coloring of __G__. We prove that the acyclic chromatic inde