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

Displaying 1421 – 1440 of 8549

Showing per page

Bounds on the Signed 2-Independence Number in Graphs

Lutz Volkmann (2013)

Discussiones Mathematicae Graph Theory

Let G be a finite and simple graph with vertex set V (G), and let f V (G) → {−1, 1} be a two-valued function. If ∑x∈N|v| f(x) ≤ 1 for each v ∈ V (G), where N[v] is the closed neighborhood of v, then f is a signed 2-independence function on G. The weight of a signed 2-independence function f is w(f) =∑v∈V (G) f(v). The maximum of weights w(f), taken over all signed 2-independence functions f on G, is the signed 2-independence number α2s(G) of G. In this work, we mainly present upper bounds on α2s(G),...

Bounds on the subdominant eigenvalue involving group inverses with applications to graphs

Stephen J. Kirkland, Neumann, Michael, Bryan L. Shader (1998)

Czechoslovak Mathematical Journal

Let A be an n × n symmetric, irreducible, and nonnegative matrix whose eigenvalues are λ 1 > λ 2 ≥ ... ≥ λ n . In this paper we derive several lower and upper bounds, in particular on λ 2 and λ n , but also, indirectly, on μ = max 2 ≤ i ≤ n | λ i | . The bounds are in terms of the diagonal entries of the group generalized inverse, Q # , of the singular and irreducible M-matrix Q = λ 1 I - A . Our starting point is a spectral resolution for Q # . We consider the case of equality in some of these inequalities and we apply our results to the algebraic connectivity of undirected...

Branching random walks on binary search trees: convergence of the occupation measure

Eric Fekete (2010)

ESAIM: Probability and Statistics

We consider branching random walks with binary search trees as underlying trees. We show that the occupation measure of the branching random walk, up to some scaling factors, converges weakly to a deterministic measure. The limit depends on the stable law whose domain of attraction contains the law of the increments. The existence of such stable law is our fundamental hypothesis. As a consequence, using a one-to-one correspondence between binary trees and plane trees, we give a description of the...

Broken Circuits in Matroids-Dohmen’s Inductive Proof

Wojciech Kordecki, Anna Łyczkowska-Hanćkowiak (2013)

Discussiones Mathematicae Graph Theory

Dohmen [4] gives a simple inductive proof of Whitney’s famous broken circuits theorem. We generalise his inductive proof to the case of matroids

C 55 -groups.

Dolfi, Silvio, Jabara, Enrico, Lucido, Maria Silvia (2004)

Sibirskij Matematicheskij Zhurnal

Currently displaying 1421 – 1440 of 8549