Displaying 321 – 340 of 659

Showing per page

Some properties complementary to Brualdi-Li matrices

Chuanlong Wang, Xuerong Yong (2015)

Czechoslovak Mathematical Journal

In this paper we derive new properties complementary to an 2 n × 2 n Brualdi-Li tournament matrix B 2 n . We show that B 2 n has exactly one positive real eigenvalue and one negative real eigenvalue and, as a by-product, reprove that every Brualdi-Li matrix has distinct eigenvalues. We then bound the partial sums of the real parts and the imaginary parts of its eigenvalues. The inverse of B 2 n is also determined. Related results obtained in previous articles are proven to be corollaries.

Some properties of generalized distance eigenvalues of graphs

Yuzheng Ma, Yan Ling Shao (2024)

Czechoslovak Mathematical Journal

Let G be a simple connected graph with vertex set V ( G ) = { v 1 , v 2 , , v n } and edge set E ( G ) , and let d v i be the degree of the vertex v i . Let D ( G ) be the distance matrix and let T r ( G ) be the diagonal matrix of the vertex transmissions of G . The generalized distance matrix of G is defined as D α ( G ) = α T r ( G ) + ( 1 - α ) D ( G ) , where 0 α 1 . Let λ 1 ( D α ( G ) ) λ 2 ( D α ( G ) ) ... λ n ( D α ( G ) ) be the generalized distance eigenvalues of G , and let k be an integer with 1 k n . We denote by S k ( D α ( G ) ) = λ 1 ( D α ( G ) ) + λ 2 ( D α ( G ) ) + ... + λ k ( D α ( G ) ) the sum of the k largest generalized distance eigenvalues. The generalized distance spread of a graph G is defined as D α S ( G ) = λ 1 ( D α ( G ) ) - λ n ( D α ( G ) ) . We obtain some...

Some properties of the distance Laplacian eigenvalues of a graph

Mustapha Aouchiche, Pierre Hansen (2014)

Czechoslovak Mathematical Journal

The distance Laplacian of a connected graph G is defined by = Diag ( Tr ) - 𝒟 , where 𝒟 is the distance matrix of G , and Diag ( Tr ) is the diagonal matrix whose main entries are the vertex transmissions in G . The spectrum of is called the distance Laplacian spectrum of G . In the present paper, we investigate some particular distance Laplacian eigenvalues. Among other results, we show that the complete graph is the unique graph with only two distinct distance Laplacian eigenvalues. We establish some properties of the distance...

Some properties of the weak subalgebra lattice of a partial algebra of a fixed type

Konrad Pióro (2002)

Archivum Mathematicum

We investigate, using results from [[p3]], when a given lattice is isomorphic to the weak subalgebra lattice of a partial algebra of a fixed type. First, we reduce this problem to the question when hyperedges of a hypergraph can be directed to a form of directed hypergraph of a fixed type. Secondly, we show that it is enough to consider some special hypergraphs. Finally, translating these results onto the lattice language, we obtain necessary conditions for our algebraic problem, and also, we completely...

Some properties of the zero divisor graph of a commutative ring

Khalida Nazzal, Manal Ghanem (2014)

Discussiones Mathematicae - General Algebra and Applications

Let Γ(R) be the zero divisor graph for a commutative ring with identity. The k-domination number and the 2-packing number of Γ(R), where R is an Artinian ring, are computed. k-dominating sets and 2-packing sets for the zero divisor graph of the ring of Gaussian integers modulo n, Γ(ℤₙ[i]), are constructed. The center, the median, the core, as well as the automorphism group of Γ(ℤₙ[i]) are determined. Perfect zero divisor graphs Γ(R) are investigated.

Some q-supercongruences for truncated basic hypergeometric series

Victor J. W. Guo, Jiang Zeng (2015)

Acta Arithmetica

For any odd prime p we obtain q-analogues of van Hamme’s and Rodriguez-Villegas’ supercongruences involving products of three binomial coefficients such as k = 0 ( p - 1 ) / 2 [ 2 k k ] q ² 3 ( q 2 k ) / ( ( - q ² ; q ² ) ² k ( - q ; q ) ² 2 k ² ) 0 ( m o d [ p ] ² ) for p≡ 3 (mod 4), k = 0 ( p - 1 ) / 2 [ 2 k k ] q ³ ( ( q ; q ³ ) k ( q ² ; q ³ ) k q 3 k ) ( ( q ; q ) k ² ) 0 ( m o d [ p ] ² ) for p≡ 2 (mod 3), where [ p ] = 1 + q + + q p - 1 and ( a ; q ) = ( 1 - a ) ( 1 - a q ) ( 1 - a q n - 1 ) . We also prove q-analogues of the Sun brothers’ generalizations of the above supercongruences. Our proofs are elementary in nature and use the theory of basic hypergeometric series and combinatorial q-binomial identities including a new q-Clausen type summation formula.

Some Ramsey type theorems for normed and quasinormed spaces

C. Henson, Nigel Kalton, N. Peck, Ignác Tereščák, Pavol Zlatoš (1997)

Studia Mathematica

We prove that every bounded, uniformly separated sequence in a normed space contains a “uniformly independent” subsequence (see definition); the constants involved do not depend on the sequence or the space. The finite version of this result is true for all quasinormed spaces. We give a counterexample to the infinite version in L p [ 0 , 1 ] for each 0 < p < 1. Some consequences for nonstandard topological vector spaces are derived.

Some recent results on domination in graphs

Michael D. Plummer (2006)

Discussiones Mathematicae Graph Theory

In this paper, we survey some new results in four areas of domination in graphs, namely: (1) the toughness and matching structure of graphs having domination number 3 and which are "critical" in the sense that if one adds any missing edge, the domination number falls to 2; (2) the matching structure of graphs having domination number 3 and which are "critical" in the sense that if one deletes any vertex, the domination number falls to 2; (3) upper bounds...

Currently displaying 321 – 340 of 659