EuDML | Browse

The search session has expired. Please query the service again.

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

Page 1 Next

Displaying 1 – 20 of 22

Edge Dominating Sets and Vertex Covers

Ronald Dutton, William F. Klostermeyer (2013)

Discussiones Mathematicae Graph Theory

Bipartite graphs with equal edge domination number and maximum matching cardinality are characterized. These two parameters are used to develop bounds on the vertex cover and total vertex cover numbers of graphs and a resulting chain of vertex covering, edge domination, and matching parameters is explored. In addition, the total vertex cover number is compared to the total domination number of trees and grid graphs.

Efficient counting and asymptotics of $k$ -noncrossing tangled diagrams.

Chen, William Y.C., Qin, Jing, Reidys, Christian M., Zeilberger, Doron (2009)

The Electronic Journal of Combinatorics [electronic only]

Ein neuer Algorithmus zur Bestimmung einer basis von unabhängigen elementarkreisen in einem stark zusammenhängenden Graphen

W. Jänicke (1976)

Applicationes Mathematicae

Eine Benutzung der Zahlenzerlegung zur Bestimmung der Anzahl unisomorpher Zyklen in $ξ$ -Turnieren

Michal Bučko (1972)

Časopis pro pěstování matematiky

Elevation of a graph

Ľudovít Niepel, Pavel Tomasta (1981)

Czechoslovak Mathematical Journal

Enumerating all Hamilton cycles and bounding the number of Hamilton cycles in 3-regular graphs.

Gebauer, Heidi (2011)

The Electronic Journal of Combinatorics [electronic only]

Enumeration and asymptotic properties of unlabeled outerplanar graphs.

Bodirsky, Manuel, Fusy, Eric, Kang, Mihyun, Vigerske, Stefan (2007)

The Electronic Journal of Combinatorics [electronic only]

Énumération des cartes pointées sue la bouteille de Klein

Didier Arquès, Jean-François Béraud (1997)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

Enumeration of binary trees and universal types.

Knessl, Charles, Szpankowski, Wojciech (2005)

Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]

Enumeration of graphs maximal with respect to connectivity

Peter Horák (1982)

Mathematica Slovaca

Enumeration of Hamiltonian circuits in rectangular grids.

Stoyan, Robert, Strehl, Volker (1995)

Séminaire Lotharingien de Combinatoire [electronic only]

Enumeration of hamiltonian paths in Caley diagrams.

David Housman (1981)

Aequationes mathematicae

Enumeration of perfect matchings of a type of quadratic lattice on the torus.

Lu, Fuliang, Zhang, Lianzhu, Lin, Fenggen (2010)

The Electronic Journal of Combinatorics [electronic only]

Enumeration problems of trees. (Abzählprobleme bei Bäumen.)

Prodinger, Helmut (1983)

Séminaire Lotharingien de Combinatoire [electronic only]

Enumeration under group action

Gian-Carlo Rota, David A. Smith (1977)

Annali della Scuola Normale Superiore di Pisa - Classe di Scienze

Enumerative formulae for unrooted planar maps: a pattern.

Liskovets, Valery A. (2004)

The Electronic Journal of Combinatorics [electronic only]

Enumerative problems inspired by Mayer's theory of cluster integrals.

Leroux, Pierre (2004)

The Electronic Journal of Combinatorics [electronic only]

Equivalence classes of functions on finite sets.

Chao, Chong-Yun, Deisher, Caroline I. (1982)

International Journal of Mathematics and Mathematical Sciences

Equivalence of a Number-Theoretical Problem with a Problem from the Graph Theory

Štefan Znám (1967)

Matematický časopis

Euler's idoneal numbers and an inequality concerning minimal graphs with a prescribed number of spanning trees

Jernej Azarija, Riste Škrekovski (2013)

Mathematica Bohemica

Let $α (n)$ be the least number $k$ for which there exists a simple graph with $k$ vertices having precisely $n \geq 3$ spanning trees. Similarly, define $β (n)$ as the least number $k$ for which there exists a simple graph with $k$ edges having precisely $n \geq 3$ spanning trees. As an $n$ -cycle has exactly $n$ spanning trees, it follows that $α (n), β (n) \leq n$ . In this paper, we show that $α (n) \leq \frac{1}{3} (n + 4)$ and $β (n) \leq \frac{1}{3} (n + 7)$ if and only if $n \notin {3, 4, 5, 6, 7, 9, 10, 13, 18, 22}$ , which is a subset of Euler’s idoneal numbers. Moreover, if $n \neg \equiv 2 (mod 3)$ and $n \neq 25$ we show that $α (n) \leq \frac{1}{4} (n + 9)$ and $β (n) \leq \frac{1}{4} (n + 13) .$ This improves some previously estabilished bounds.

Currently displaying 1 – 20 of 22

Page 1 Next