共查询到20条相似文献,搜索用时 31 毫秒
1.
Let be a digraph with n vertices and m arcs without loops and multiarcs. The spectral radius of G is the largest eigenvalue of its adjacency matrix. In this paper, the following sharp bounds on have been obtained.where G is strongly connected and is the average 2-outdegree of vertex . Moreover, each equality holds if and only if G is average 2-outdegree regular or average 2-outdegree semiregular. 相似文献
2.
3.
刘岚喆 《数学物理学报(B辑英文版)》2005,25(1):89-94
It is proved that, for the nondivergence elliptic equations ∑in, j=1 aijuxixj = f,if f belongs to the generalized Morrey spaces Lp,ψ(ω), then uxixj ∈ Lp,ψ(ω), where u is the W2,p-solution of the equations. In order to obtain this, the author first establish the weighted boundedness for the commutators of some singular integral operators on Lp,ψ (ω). 相似文献
4.
5.
The Catalan numbers occur in various counting problems in combinatorics. This paper reveals a connection between the Catalan numbers and list colouring of graphs. Assume is a graph and is a mapping. For a nonnegative integer , let be the extension of to the graph for which for each vertex of . Let be the minimum such that is not -choosable and be the minimum such that is not -paintable. We study the parameter and for arbitrary mappings . For , an -dominated path ending at is a monotonic path of the grid from to such that each vertex on satisfies . Let be the number of -dominated paths ending at . By this definition, the Catalan number equals . This paper proves that if has vertices and , then , where and for . Therefore, if , then equals the Catalan number . We also show that if is the disjoint union of graphs and , then and . This generalizes a result in Carraher et al. (2014), where the case each is a copy of is considered. 相似文献
6.
7.
8.
9.
10.
A graph is dyadic provided it has a representation from vertices of to subtrees of a host tree with maximum degree 3 such that and are adjacent in if and only if and share at least three nodes and each edge of is used by exactly two representing subtrees. We show that a connected graph is dyadic if and only if it can be constructed from edges and cycles by gluing vertices to vertices and edges to edges. 相似文献
11.
12.
13.
Let be a graph of order . An even squared Hamiltonian cycle (ESHC) of is a Hamiltonian cycle of with chords for all (where for ). When is even, an ESHC contains all bipartite -regular graphs of order . We prove that there is a positive integer such that for every graph of even order , if the minimum degree is , then contains an ESHC. We show that the condition of being even cannot be dropped and the constant cannot be replaced by . Our results can be easily extended to even th powered Hamiltonian cycles for all . 相似文献
14.
Christoph Brause Arnfried Kemnitz Massimiliano Marangio Anja Pruchnewski Margit Voigt 《Discrete Mathematics》2017,340(11):2633-2640
Let be a simple graph and for every vertex let be a set (list) of available colors. is called -colorable if there is a proper coloring of the vertices with for all . A function is called a choice function of and is said to be -list colorable if is -colorable for every list assignment choice function is defined by and the sum choice number
denotes the minimum size of a choice function of .Sum list colorings were introduced by Isaak in 2002 and got a lot of attention since then.For a generalized
-graph is a simple graph consisting of two vertices and connected by internally vertex disjoint paths of lengths
.In 2014, Carraher et al. determined the sum-paintability of all generalized -graphs which is an online-version of the sum choice number and consequently an upper bound for it.In this paper we obtain sharp upper bounds for the sum choice number of all generalized -graphs with and characterize all generalized -graphs which attain the trivial upper bound . 相似文献
15.
16.
A 2-coloring is a coloring of vertices of a graph with colors 1 and 2. Define for and We say that is -colorable if has a 2-coloring such that is an empty set or the induced subgraph has the maximum degree at most for and Let be a planar graph without 4-cycles and 5-cycles. We show that the problem to determine whether is -colorable is NP-complete for every positive integer Moreover, we construct non--colorable planar graphs without 4-cycles and 5-cycles for every positive integer In contrast, we prove that is -colorable where and 相似文献
17.
18.
19.