✦ LIBER ✦

Antimagic labeling graphs with a regular dominating subgraph

✍ Scribed by Radek Slíva

Book ID: 116577159
Publisher: Elsevier Science
Year: 2012
Tongue: English
Weight: 132 KB
Volume: 112
Category: Article
ISSN: 0020-0190
DOI: 10.1016/j.ipl.2012.07.017

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Vertex-antimagic labelings of regular gr

Vertex-antimagic labelings of regular graphs

✍ Ali Ahmad, Kashif Ali, Martin Bača, Petr Kovář, Andrea Semaničová-Feňovčíková 📂 Article 📅 2012 🏛 Institute of Mathematics, Chinese Academy of Scien 🌐 English ⚖ 216 KB

Construction of Antimagic Labeling for t

Construction of Antimagic Labeling for the Cartesian Product of Regular Graphs

✍ Oudone Phanalasy; Mirka Miller; Costas S. Iliopoulos; Solon P. Pissis; Elaheh Va 📂 Article 📅 2011 🏛 Springer-Verlag 🌐 English ⚖ 202 KB

A Distance-Regular Graph with Strongly C

A Distance-Regular Graph with Strongly Closed Subgraphs

✍ Akira Hiraki 📂 Article 📅 2001 🏛 Springer 🌐 English ⚖ 56 KB

Distance-regular subgraphs in a distance

Distance-regular subgraphs in a distance-regular graph, I

✍ Akira Hiraki 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 638 KB

Distance-regular subgraphs in a distance

Distance-regular subgraphs in a distance-regular graph, II

✍ Akira Hiraki 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 585 KB

Distance-regular Subgraphs in a Distance

Distance-regular Subgraphs in a Distance-regular Graph, III

✍ Akira Hiraki 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 254 KB

Let ⌫ be a distance-regular graph with l (1 , a 1 , b 1 ) ϭ 1 and c s ϩ 1 ϭ 1 for some positive integer s . We show the existence of a certain distance-regular graph of diameter s , containing given two vertices at distance s , as a subgraph in ⌫ .