A function whose graph has positive doubling measure
نویسندگان
چکیده
منابع مشابه
Groups whose Bipartite Divisor Graph for Character Degrees Has Five Vertices
Let $G$ be a finite group and $cd^*(G)$ be the set of nonlinear irreducible character degrees of $G$. Suppose that $rho(G)$ denotes the set of primes dividing some element of $cd^*(G)$. The bipartite divisor graph for the set of character degrees which is denoted by $B(G)$, is a bipartite graph whose vertices are the disjoint union of $rho(G)$ and $cd^*(G)$, and a vertex $p in rho(G)$ is conne...
متن کاملTowards a measure of vulnerability, tenacity of a Graph
If we think of the graph as modeling a network, the vulnerability measure the resistance of the network to disruption of operation after the failure of certain stations or communication links. Many graph theoretical parameters have been used to describe the vulnerability of communication networks, including connectivity, integrity, toughness, binding number and tenacity.In this paper we discuss...
متن کاملDegree-doubling graph families
Let G be a family of n–vertex graphs of uniform degree 2 with the property that the union of any two member graphs has degree four. We determine the leading term in the asymptotics of the largest cardinality of such a family. Several analogous problems are discussed.
متن کاملAccelerated cosmological expansion due to a scalar field whose potential has a positive lower bound
In many cases a nonlinear scalar field with potential V can lead to accelerated expansion in cosmological models. This paper contains mathematical results on this subject for homogeneous spacetimes. It is shown that, under the assumption that V has a strictly positive minimum, Wald’s theorem on spacetimes with positive cosmological constant can be generalized to a wide class of potentials. In s...
متن کاملThe chromatic index of a graph whose core has maximum degree two
Let G be a graph. The core of G, denoted by G∆, is the subgraph of G induced by the vertices of degree ∆(G), where ∆(G) denotes the maximum degree of G. A k-edge coloring of G is a function f : E(G)→ L such that |L| = k and f(e1) 6= f(e2) for all two adjacent edges e1 and e2 of G. The chromatic index of G, denoted by χ′(G), is the minimum number k for which G has a k-edge coloring. A graph G is...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 2015
ISSN: 0002-9939,1088-6826
DOI: 10.1090/proc12748