Straight-line drawings of binary trees with linear area and arbitrary aspect ratio.
Previous Page 3
Garg, Ashim, Rusu, Adrian (2004)
Journal of Graph Algorithms and Applications
Mustapha Chellali, Nader Jafari Rad (2013)
Discussiones Mathematicae Graph Theory
A Roman dominating function (RDF) on a graph G = (V,E) is a function f : V −→ {0, 1, 2} satisfying the condition that every vertex u for which f(u) = 0 is adjacent to at least one vertex v for which f(v) = 2. The weight of an RDF is the value f(V (G)) = P u2V (G) f(u). An RDF f in a graph G is independent if no two vertices assigned positive values are adjacent. The Roman domination number R(G) (respectively, the independent Roman domination number iR(G)) is the minimum weight of an RDF (respectively,...
Yangjiang Wei, Jizhu Nan, Gaohua Tang (2012)
Czechoslovak Mathematical Journal
Let be the ring of Gaussian integers modulo . We construct for a cubic mapping graph whose vertex set is all the elements of and for which there is a directed edge from to if . This article investigates in detail the structure of . We give suffcient and necessary conditions for the existence of cycles with length . The number of -cycles in is obtained and we also examine when a vertex lies on a -cycle of , where is induced by all the units of while is induced by all the...
Lamei Yuan, Henan Wu (2016)
Open Mathematics
The purpose of this paper is to study W(2, 2) Lie conformal algebra, which has a free ℂ[∂]-basis L, M such that [...] [LλL]=(∂+2λ)L,[LλM]=(∂+2λ)M,[MλM]=0 . In this paper, we study conformal derivations, central extensions and conformal modules for this Lie conformal algebra. Also, we compute the cohomology of this Lie conformal algebra with coefficients in its modules. In particular, we determine its cohomology with trivial coefficients both for the basic and reduced complexes.
Bohdan Zelinka (1980)
Czechoslovak Mathematical Journal
Tomáš Flouri, Jan Janoušek, Bořivoj Melichar (2010)
Computer Science and Information Systems
Novelli, Jean-Christophe, Thibon, Jean-Yves (2009)
The Electronic Journal of Combinatorics [electronic only]
Claude Flament (1993)
Mathématiques et Sciences Humaines
Un algorithme pour la recherche de la réunion des arbres maximaux (RAM) d'un graphe préordonné était proposé dans un article précédent (Math. Inf. Sci. hum. n°114, 1991, 35-40). Cet algorithme, qui était incorrect, est complété, justifié et illustré par un exemple dans cette note.
J. P. Barthelemy, N. X. Luong (1987)
Mathématiques et Sciences Humaines
Jean Françon (1984)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Alan J. Gold (1975)
Annales scientifiques de l'Université de Clermont. Mathématiques
Norbert A'Campo (1976)
Inventiones mathematicae
Gérard Letac (1972)
Annales scientifiques de l'Université de Clermont. Mathématiques
Martin Bača, J.A. MacDougall, Mirka Miller, Slamin, W.D. Wallis (2000)
Discussiones Mathematicae Graph Theory
The study of valuations of graphs is a relatively young part of graph theory. In this article we survey what is known about certain graph valuations, that is, labeling methods: antimagic labelings, edge-magic total labelings and vertex-magic total labelings.
Previous Page 3