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 261 – 280 of 849

The geometry of non-unit Pisot substitutions

Milton Minervino, Jörg Thuswaldner (2014)

Annales de l’institut Fourier

It is known that with a non-unit Pisot substitution $σ$ one can associate certain fractal tiles, so-called Rauzy fractals. In our setting, these fractals are subsets of a certain open subring of the adèle ring of the associated Pisot number field. We present several approaches on how to define Rauzy fractals and discuss the relations between them. In particular, we consider Rauzy fractals as the natural geometric objects of certain numeration systems, in terms of the dual of the one-dimensional realization...

The graph of generating sets of an abelian group

Persi Diaconis, Ronald Graham (1999)

Colloquium Mathematicae

The graph of labellings of a given graph

Bohdan Zelinka (1988)

Mathematica Slovaca

The graph polynomial and the number of proper vertex coloring

Michael Tarsi (1999)

Annales de l'institut Fourier

Alon and Tarsi presented in a previous paper a certain weighted sum over the set of all proper $k$ -colorings of a graph, which can be computed from its graph polynomial. The subject of this paper is another combinatorial interpretation of the same quantity, expressed in terms of the numbers of certain modulo $k$ flows in the graph. Some relations between graph parameters can be obtained by combining these two formulas. For example: The number of proper 3-colorings of a 4-regular graph and the number...

The greedy algorithm as a combinatorial principle.

Faigle, Ulrich (1981)

Séminaire Lotharingien de Combinatoire [electronic only]

The Green formula and HP Spaces on trees.

Fausto Di Biase, Massimo A. Picardello (1995)

Mathematische Zeitschrift

The Grötzsch theorem for the hypergraph of maximal cliques.

Mohar, Bojan, Škrekovski, Riste (1999)

The Electronic Journal of Combinatorics [electronic only]

The group of autotopies of a digraph

Bohdan Zelinka (1971)

Czechoslovak Mathematical Journal

The Gutman Index and the Edge-Wiener Index of Graphs with Given Vertex-Connectivity

Jaya Percival Mazorodze, Simon Mukwembi, Tomáš Vetrík (2016)

Discussiones Mathematicae Graph Theory

The Gutman index and the edge-Wiener index have been extensively investigated particularly in the last decade. An important stream of re- search on graph indices is to bound indices in terms of the order and other parameters of given graph. In this paper we present asymptotically sharp upper bounds on the Gutman index and the edge-Wiener index for graphs of given order and vertex-connectivity κ, where κ is a constant. Our results substantially generalize and extend known results in the area.

The Hadwiger number of an infinite graph

Bohdan Zelinka (1976)

Mathematica Slovaca

The Hadwiger number of complements of some graphs

Jaroslav Ivančo (1997)

Mathematica Slovaca

The half-perimeter generating function of gated and wicketed Ferrers diagrams.

Ayyer, Arvind (2007)

Journal of Integer Sequences [electronic only]

The hamiltonian chromatic number of a connected graph without large hamiltonian-connected subgraphs

Ladislav Nebeský (2006)

Czechoslovak Mathematical Journal

If $G$ is a connected graph of order $n \geq 1$ , then by a hamiltonian coloring of $G$ we mean a mapping $c$ of $V (G)$ into the set of all positive integers such that $| c (x) - c (y) | \geq n - 1 - D_{G} (x, y)$ (where $D_{G} (x, y)$ denotes the length of a longest $x - y$ path in $G$ ) for all distinct $x, y \in V (G)$ . Let $G$ be a connected graph. By the hamiltonian chromatic number of $G$ we mean $min (max (c (z); z \in V (G))),$ where the minimum is taken over all hamiltonian colorings $c$ of $G$ . The main result of this paper can be formulated as follows: Let $G$ be a connected graph of order $n \geq 3$ . Assume that there exists a subgraph...

The height of directed column-convex polyominoes. (La hauteur des polyominos dirigés verticalement convexe.)

Barcucci, Elena, del Lungo, Alberto, Pinzani, Renzo, Sprugnoli, Renzo (1993)

Séminaire Lotharingien de Combinatoire [electronic only]

The higher-order matching polynomial of a graph.

Araujo, Oswaldo, Estrada, Mario, Morales, Daniel A., Rada, Juan (2005)

International Journal of Mathematics and Mathematical Sciences

The hive model and the factorisation of Kostka coefficients.

King, Ronald C., Tollu, Christophe, Toumazet, Frédéric (2005)

Séminaire Lotharingien de Combinatoire [electronic only]

The hive model and the polynomial nature of stretched Littlewood-Richardson coefficients.

King, Ronald C., Tollu, Christophe, Toumazet, Frédéric (2005)

Séminaire Lotharingien de Combinatoire [electronic only]

The hook fusion procedure.

Grime, James (2005)

The Electronic Journal of Combinatorics [electronic only]

The hull number of an oriented graph.

Chartrand, Gary, Fink, John Frederick, Zhang, Ping (2003)

International Journal of Mathematics and Mathematical Sciences

The hull number of strong product graphs

A.P. Santhakumaran, S.V. Ullas Chandran (2011)

Discussiones Mathematicae Graph Theory

For a connected graph G with at least two vertices and S a subset of vertices, the convex hull ${[S]}_{G}$ is the smallest convex set containing S. The hull number h(G) is the minimum cardinality among the subsets S of V(G) with ${[S]}_{G} = V (G)$ . Upper bound for the hull number of strong product G ⊠ H of two graphs G and H is obtainted. Improved upper bounds are obtained for some class of strong product graphs. Exact values for the hull number of some special classes of strong product graphs are obtained. Graphs G and H...

Currently displaying 261 – 280 of 849

Previous Page 14 Next