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 48 Next

Displaying 941 – 960 of 5365

Showing per page

Characterizing the interval function of a connected graph

Ladislav Nebeský (1998)

Mathematica Bohemica

As was shown in the book of Mulder [4], the interval function is an important tool for studying metric properties of connected graphs. An axiomatic characterization of the interval function of a connected graph was given by the present author in [5]. (Using the terminology of Bandelt, van de Vel and Verheul [1] and Bandelt and Chepoi [2], we may say that [5] gave a necessary and sufficient condition for a finite geometric interval space to be graphic). In the present paper, the result given in [5]...

Characterizing which Powers of Hypercubes and Folded Hyper- cubes Are Divisor Graphs

Eman A. AbuHijleh, Omar A. AbuGhneim, Hasan Al-Ezeh (2015)

Discussiones Mathematicae Graph Theory

In this paper, we show that Qkn is a divisor graph, for n = 2, 3. For n ≥ 4, we show that Qkn is a divisor graph iff k ≥ n − 1. For folded-hypercube, we get FQn is a divisor graph when n is odd. But, if n ≥ 4 is even integer, then FQn is not a divisor graph. For n ≥ 5, we show that (FQn)k is not a divisor graph, where 2 ≤ k ≤ [n/2] − 1.

Cheeger inequalities for unbounded graph Laplacians

Frank Bauer, Matthias Keller, Radosław K. Wojciechowski (2015)

Journal of the European Mathematical Society

We use the concept of intrinsic metrics to give a new definition for an isoperimetric constant of a graph. We use this novel isoperimetric constant to prove a Cheeger-type estimate for the bottom of the spectrum which is nontrivial even if the vertex degrees are unbounded.

Choice-Perfect Graphs

Zsolt Tuza (2013)

Discussiones Mathematicae Graph Theory

Given a graph G = (V,E) and a set Lv of admissible colors for each vertex v ∈ V (termed the list at v), a list coloring of G is a (proper) vertex coloring ϕ : V → S v2V Lv such that ϕ(v) ∈ Lv for all v ∈ V and ϕ(u) 6= ϕ(v) for all uv ∈ E. If such a ϕ exists, G is said to be list colorable. The choice number of G is the smallest natural number k for which G is list colorable whenever each list contains at least k colors. In this note we initiate the study of graphs in which the choice number equals...

Chromatic number of the product of graphs, graph homomorphisms, antichains and cofinal subsets of posets without AC

Amitayu Banerjee, Zalán Gyenis (2021)

Commentationes Mathematicae Universitatis Carolinae

In set theory without the axiom of choice (AC), we observe new relations of the following statements with weak choice principles. ∘ If in a partially ordered set, all chains are finite and all antichains are countable, then the set is countable. ∘ If in a partially ordered set, all chains are finite and all antichains have size ℵ α , then the set has size ℵ α for any regular ℵ α . ∘ Every partially ordered set without a maximal element has two disjoint cofinal sub sets – CS. ∘ Every partially ordered set...

Currently displaying 941 – 960 of 5365