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

Displaying 161 – 180 of 294

Minimal trees and monophonic convexity

Jose Cáceres, Ortrud R. Oellermann, M. L. Puertas (2012)

Discussiones Mathematicae Graph Theory

Let V be a finite set and 𝓜 a collection of subsets of V. Then 𝓜 is an alignment of V if and only if 𝓜 is closed under taking intersections and contains both V and the empty set. If 𝓜 is an alignment of V, then the elements of 𝓜 are called convex sets and the pair (V,𝓜 ) is called an alignment or a convexity. If S ⊆ V, then the convex hull of S is the smallest convex set that contains S. Suppose X ∈ ℳ. Then x ∈ X is an extreme point for X if X∖{x} ∈ ℳ. A convex geometry on a finite set is...

Minimal vertex degree sum of a 3-path in plane maps

O.V. Borodin (1997)

Discussiones Mathematicae Graph Theory

Let wₖ be the minimum degree sum of a path on k vertices in a graph. We prove for normal plane maps that: (1) if w₂ = 6, then w₃ may be arbitrarily big, (2) if w₂ < 6, then either w₃ ≤ 18 or there is a ≤ 15-vertex adjacent to two 3-vertices, and (3) if w₂ < 7, then w₃ ≤ 17.

Minimal weight in union-closed families.

Falgas-Ravry, Victor (2011)

The Electronic Journal of Combinatorics [electronic only]

Minimale Gitterwege mit Nebenbedingungen.

J.C. Binz (1977)

Elemente der Mathematik

Minimale nicht in die Ringfläche einbettbare Graphen.

Egon Joachim (1978)

Elemente der Mathematik

Minimal-Energy Clusters of Hard Spheres.

J.H. Conway, N.J.A. Sloane, R.H. Hardin, T.D.S. Duff (1995)

Discrete & computational geometry

Minimality of toric arrangements

Giacomo d'Antonio, Emanuele Delucchi (2015)

Journal of the European Mathematical Society

We prove that the complement of a toric arrangement has the homotopy type of a minimal CW-complex. As a corollary we deduce that the integer cohomology of these spaces is torsionfree. We apply discrete Morse theory to the toric Salvetti complex, providing a sequence of cellular collapses that leads to a minimal complex.

Minimally intersecting set partitions of type B.

Chen, William Y.C., Wang, David G.L. (2010)

The Electronic Journal of Combinatorics [electronic only]

Minimally n-line connected graphs.

Don R. Lick (1972)

Journal für die reine und angewandte Mathematik

Minimax degrees of quasiplane graphs without 4-faces.

Borodin, O.V., Ivanova, A.O., Kostochka, A.V., Sheikh, N.N. (2007)

Sibirskie Ehlektronnye Matematicheskie Izvestiya [electronic only]

Minimization of ±1 matrices under line shifts

Thomas A. Brown, Joel H. Spencer (1971)

Colloquium Mathematicae

Minimizing Laplacian spectral radius of unicyclic graphs with fixed girth

Kamal Lochan Patra, Binod Kumar Sahoo (2013)

Czechoslovak Mathematical Journal

In this paper we consider the following problem: Over the class of all simple connected unicyclic graphs on $n$ vertices with girth $g$ ( $n$ , $g$ being fixed), which graph minimizes the Laplacian spectral radius? Let $U_{n, g}$ be the lollipop graph obtained by appending a pendent vertex of a path on $n - g$ $(n > ...$

Minimum congestion spanning trees of grids and discrete toruses

Alberto Castejón, Mikhail I. Ostrovskii (2009) Discussiones Mathematicae Graph Theory

The paper is devoted to estimates of the spanning tree congestion for grid graphs and discrete toruses of dimensions two and three.

Minimum connected dominating sets of random cubic graphs.

Duckworth, W. (2002) The Electronic Journal of Combinatorics [electronic only]

Minimum convex-cost tension problems on series-parallel graphs

Bruno Bachelet, Philippe Mahey (2003) RAIRO - Operations Research - Recherche Opérationnelle

We present briefly some results we obtained with known methods to solve minimum cost tension problems, comparing their performance on non-specific graphs and on series-parallel graphs. These graphs are shown to be of interest to approximate many tension problems, like synchronization in hypermedia documents. We propose a new aggregation method to solve the minimum convex piecewise linear cost tension problem on series-parallel graphs in

O (m^{3})

operations.

Minimum convex-cost tension problems on series-parallel graphs

Bruno Bachelet, Philippe Mahey (2010)

RAIRO - Operations Research

Minimum cut in directed planar networks

Ladislav Janiga, Václav Koubek (1992)

Kybernetika

Minimum degree, leaf number and traceability

Simon Mukwembi (2013)

Czechoslovak Mathematical Journal

Let $G$ be a finite connected graph with minimum degree $δ$ . The leaf number $L (G)$ of $G$ is defined as the maximum number of leaf vertices contained in a spanning tree of $G$ . We prove that if $δ \geq \frac{1}{2} (L (G) + 1)$ , then $G$ is 2-connected. Further, we deduce, for graphs of girth greater than 4, that if $δ \geq \frac{1}{2} (L (G) + 1)$ , then $G$ contains a spanning path. This provides a partial solution to a conjecture of the computer program Graffiti.pc [DeLaVi na and Waller, Spanning trees with many leaves and average distance, Electron. J. Combin. 15 (2008),...

Minimum distances of error-correcting codes in incidence rings.

Kelarev, A.V. (2003)

International Journal of Mathematics and Mathematical Sciences

Minimum functors on categories of Neumann trees

Rotraut Goebel (1981)

Časopis pro pěstování matematiky

Currently displaying 161 – 180 of 294

Previous Page 9 Next