QR Kodea

On d-antimagic labelings of plane graphs

The paper deals with the problem of labeling the vertices and edges of a plane graph in such a way that the labels of the vertices and edges surrounding that face add up to a weight of that face. A labeling of a plane graph is called <em>d</em>-antimagic if for every positive integer <em>s</em>, the...

Deskribapen osoa

Gorde:
Xehetasun bibliografikoak
Egile Nagusiak: Martin Baca, Ljiljana Brankovic, Marcela Lascsakova, Oudone Phanalasy, Andrea Semanicova-Fenovciova
Formatua: Artigo
Hizkuntza:Inglês
Argitaratua: Indonesian Combinatorial Society (InaCombS); Graph Theory and Applications (GTA) Research Centre; University of Newcastle, Australia; Institut Teknologi Bandung (ITB), Indonesia 2013-04-01
Saila:Electronic Journal of Graph Theory and Applications
Gaiak:
Sarrera elektronikoa:http://www.ejgta.org/index.php/ejgta/article/view/16
Etiketak: Etiketa erantsi
Etiketarik gabe, Izan zaitez lehena erregistro honi etiketa jartzen!