共查询到20条相似文献,搜索用时 62 毫秒
1.
2.
Two classes of edge domination in graphs 总被引:2,自引:0,他引:2
Baogen Xu 《Discrete Applied Mathematics》2006,154(10):1541-1546
Let (, resp.) be the number of (local) signed edge domination of a graph G [B. Xu, On signed edge domination numbers of graphs, Discrete Math. 239 (2001) 179-189]. In this paper, we prove mainly that and hold for any graph G of order n(n?4), and pose several open problems and conjectures. 相似文献
3.
4.
5.
Improved bounds for acyclic chromatic index of planar graphs 总被引:1,自引:0,他引:1
6.
7.
8.
9.
10.
11.
12.
S. Jahanbekam 《Discrete Applied Mathematics》2009,157(2):400-401
Let G be a graph of order n and denote the signed edge domination number of G. In [B. Xu, Two classes of edge domination in graphs, Discrete Appl. Math. 154 (2006) 1541-1546] it was proved that for any graph G of order n, . But the method given in the proof is not correct. In this paper we give an example for which the method of proof given in [1] does not work. 相似文献
13.
A discrete function f defined on Zn is said to be logconcave if for , , . A more restrictive notion is strong unimodality. Following Barndorff-Nielsen [O. Barndorff-Nielsen, Unimodality and exponential families, Commun. Statist. 1 (1973) 189-216] a discrete function is called strongly unimodal if there exists a convex function such that if . In this paper sufficient conditions that ensure the strong unimodality of a multivariate discrete distribution, are given. Examples of strongly unimodal multivariate discrete distributions are presented. 相似文献
14.
On edge domination numbers of graphs 总被引:1,自引:0,他引:1
Baogen Xu 《Discrete Mathematics》2005,294(3):311-316
Let and be the signed edge domination number and signed star domination number of G, respectively. We prove that holds for all graphs G without isolated vertices, where n=|V(G)|?4 and m=|E(G)|, and pose some problems and conjectures. 相似文献
15.
16.
Jonathan Lenchner 《Discrete Applied Mathematics》2011,159(7):612-620
17.
18.
Angelika Hellwig 《Discrete Applied Mathematics》2008,156(17):3325-3328
Let G be a graph with minimum degree δ(G), edge-connectivity λ(G), vertex-connectivity κ(G), and let be the complement of G.In this article we prove that either λ(G)=δ(G) or . In addition, we present the Nordhaus-Gaddum type result . A family of examples will show that this inequality is best possible. 相似文献
19.