Báo cáo toán học: "On graphs with cyclic defect or excess" docx

... g = 2k + 1. Graphs missing or exceeding the Moore bound by ǫ are called graphs with defect or excess ǫ, respectively. While Moore graphs (graphs with ǫ = 0) and graphs with defect or excess 1 ... structure of the defect or excess graphs of the known non- trivial graphs with defect or excess 2. Cyclic structure of graphs of defect 2 For the M¨obius...

Ngày tải lên: 08/08/2014, 12:22

... Extension of a theorem of Moon and Moser on complete subgraphs, Ars Combinatoria 16 (1983) 5–10. [2] F. Chung, L. Lu, An Upper Bound for the Tur´an Number t 3 (n, 4),J.Combin.Theory Ser. A 87 (1999), ... P. Erd˝os, M. Simonovits, Supersaturated graphs and hypergraphs, Combinatorica, 3, (1983), 181–192. [4] P. Frankl, Z. F¨uredi, An exact result for 3 -graphs. Discrete Math. 50 (1984), no. 2...

Ngày tải lên: 07/08/2014, 07:21

... is by induction on q. For q = 0 Theorem 6 is exactly Theorem 4. Assuming that the theorem holds for an integer q ≥ 0 we shall prove it for q + 1. Let F be a forest of order 4p + 4(q + 1) and ... of order 4p with a cyclic self-complementary permutation then k ≤ 3p − 1. Thus the star K 1,3p is not a subgraph of any self-complementary graph of order 4p with cyclic permutation, and Theore...

Ngày tải lên: 07/08/2014, 15:23

... extremal graphs, G with f (G)=2δ +1. The connected extremal graphs are those given in Theorem 3 along with the trivial ones with only 2δ + 1 vertices. We noticed that the proof of Theorem 3 is ... K δ+1 with vertex v in common. Proof: i) Since G has no cut vertex, Theorem 4 of [3] assures us that there is a cycle of at least 2δ vertices. Let C, with vertices v 1 ,v 2 , ···,v 2δ i...

Ngày tải lên: 07/08/2014, 06:20

... d-regular graph of order n without a k-factor. For a regular graph with radius ≤ 3, Theorem 1.1 provides conditions for the existence of a k-factor, which allow for a higher order than Theorem 1.4. 2 ... the eccentricity of vertices into ∗ corresponding author the electronic journal of combinatorics 11 (2004), #R7 1 For regular graphs without a k-factor, for odd k, we can give the followi...

Ngày tải lên: 07/08/2014, 08:20

... notice below). For information about publishing your research in Fixed Point Theory and Applications go to http://www.fixedpointtheoryandapplications.com/authors/instructions/ For information about ... Ω such that for each x ∈ X with x /∈ T x, it holds p(y, T y) ≤ p(x, y) − µ(p(x, y)) for all y ∈ T x. 23 and for each x ∈ X with x /∈ T x, it holds p(y, T y) ≤ ϕ(p(x, y))p(x, y) for all y ∈...

Ngày tải lên: 20/06/2014, 20:20

Ngày tải lên: 05/08/2014, 09:46

Ngày tải lên: 05/08/2014, 10:20

Ngày tải lên: 05/08/2014, 15:20

Ngày tải lên: 05/08/2014, 15:20