EuDML | Browse

Items

All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Previous Page 2

Displaying 21 – 34 of 34

Computing the molecular expansion of species with the Maple package Devmol.

Auger, Pierre, Labelle, Gilbert, Leroux, Pierre (2002)

Séminaire Lotharingien de Combinatoire [electronic only]

Connected Components of Arithmetic Graphs.

Melvyn B. Nathanson (1980)

Monatshefte für Mathematik

Connected domatic number in planar graphs

Bert L. Hartnell, Douglas F. Rall (2001)

Czechoslovak Mathematical Journal

A dominating set in a graph $G$ is a connected dominating set of $G$ if it induces a connected subgraph of $G$ . The connected domatic number of $G$ is the maximum number of pairwise disjoint, connected dominating sets in $V (G)$ . We establish a sharp lower bound on the number of edges in a connected graph with a given order and given connected domatic number. We also show that a planar graph has connected domatic number at most 4 and give a characterization of planar graphs having connected domatic number 3.

Connected domatic number of a graph

Bohdan Zelinka (1986)

Mathematica Slovaca

Connected graphs containing a given connected graph as a unique greatest common subgraph.

Gary Chartrand, Mark Johnson (1986)

Aequationes mathematicae

Connections between the matching and chromatic polynomials.

Farrell, E.J., Whitehead, Earl Glen jun. (1992)

International Journal of Mathematics and Mathematical Sciences

Connectivity of Regular Graphs and the Existence of 1-Factors

Ján Plesník (1972)

Matematický časopis

Construction of codes identifying sets of vertices.

Gravier, Sylvain, Moncel, Julien (2005)

The Electronic Journal of Combinatorics [electronic only]

Containers and wide diameters of $P_{3} (G)$

Daniela Ferrero, Manju K. Menon, A. Vijayakumar (2012)

Mathematica Bohemica

The $P_{3}$ intersection graph of a graph $G$ has for vertices all the induced paths of order 3 in $G$ . Two vertices in $P_{3} (G)$ are adjacent if the corresponding paths in $G$ are not disjoint. A $w$ -container between two different vertices $u$ and $v$ in a graph $G$ is a set of $w$ internally vertex disjoint paths between $u$ and $v$ . The length of a container is the length of the longest path in it. The $w$ -wide diameter of $G$ is the minimum number $l$ such that there is a $w$ -container of length at most $l$ between any pair of different...

Contribution to the problem of the spectra of compound graphs.

I. Gutman (1978)

Publications de l'Institut Mathématique [Elektronische Ressource]

Convex universal fixers

Magdalena Lemańska, Rita Zuazua (2012)

Discussiones Mathematicae Graph Theory

In [1] Burger and Mynhardt introduced the idea of universal fixers. Let G = (V, E) be a graph with n vertices and G’ a copy of G. For a bijective function π: V(G) → V(G’), define the prism πG of G as follows: V(πG) = V(G) ∪ V(G’) and $E (π G) = E (G) \cup E (G^{'}) \cup M_{π}$ , where $M_{π} = u π (u) | u \in V (G)$ . Let γ(G) be the domination number of G. If γ(πG) = γ(G) for any bijective function π, then G is called a universal fixer. In [9] it is conjectured that the only universal fixers are the edgeless graphs K̅ₙ. In this work we generalize the concept of universal...

Currently displaying 21 – 34 of 34