Page 1

Displaying 1 – 15 of 15

Showing per page

On graphs with the largest Laplacian index

Bo Lian Liu, Zhibo Chen, Muhuo Liu (2008)

Czechoslovak Mathematical Journal

Let G be a connected simple graph on n vertices. The Laplacian index of G , namely, the greatest Laplacian eigenvalue of G , is well known to be bounded above by n . In this paper, we give structural characterizations for graphs G with the largest Laplacian index n . Regular graphs, Hamiltonian graphs and planar graphs with the largest Laplacian index are investigated. We present a necessary and sufficient condition on n and k for the existence of a k -regular graph G of order n with the largest Laplacian...

On some properties of the Laplacian matrix revealed by the RCM algorithm

Francisco Pedroche, Miguel Rebollo, Carlos Carrascosa, Alberto Palomares (2016)

Czechoslovak Mathematical Journal

In this paper we present some theoretical results about the irreducibility of the Laplacian matrix ordered by the Reverse Cuthill-McKee (RCM) algorithm. We consider undirected graphs with no loops consisting of some connected components. RCM is a well-known scheme for numbering the nodes of a network in such a way that the corresponding adjacency matrix has a narrow bandwidth. Inspired by some properties of the eigenvectors of a Laplacian matrix, we derive some properties based on row sums of a...

On the divisibility of power LCM matrices by power GCD matrices

Jian Rong Zhao, Shaofang Hong, Qunying Liao, Kar-Ping Shum (2007)

Czechoslovak Mathematical Journal

Let S = { x 1 , , x n } be a set of n distinct positive integers and e 1 an integer. Denote the n × n power GCD (resp. power LCM) matrix on S having the e -th power of the greatest common divisor ( x i , x j ) (resp. the e -th power of the least common multiple [ x i , x j ] ) as the ( i , j ) -entry of the matrix by ( ( x i , x j ) e ) (resp. ( [ x i , x j ] e ) ) . We call the set S an odd gcd closed (resp. odd lcm closed) set if every element in S is an odd number and ( x i , x j ) S (resp. [ x i , x j ] S ) for all 1 i , j n . In studying the divisibility of the power LCM and power GCD matrices, Hong conjectured in 2004 that...

On the inertia sets of some symmetric sign patterns

C. M. da Fonseca (2006)

Czechoslovak Mathematical Journal

A matrix whose entries consist of elements from the set { + , - , 0 } is a sign pattern matrix. Using a linear algebra theoretical approach we generalize of some recent results due to Hall, Li and others involving the inertia of symmetric tridiagonal sign matrices.

On the matrix negative Pell equation

Aleksander Grytczuk, Izabela Kurzydło (2009)

Discussiones Mathematicae - General Algebra and Applications

Let N be a set of natural numbers and Z be a set of integers. Let M₂(Z) denotes the set of all 2x2 matrices with integer entries. We give necessary and suficient conditions for solvability of the matrix negative Pell equation (P) X² - dY² = -I with d ∈ N for nonsingular X,Y belonging to M₂(Z) and his generalization (Pn) i = 1 n X i - d i = 1 n Y ² i = - I with d ∈ N for nonsingular X i , Y i M ( Z ) , i=1,...,n.

Currently displaying 1 – 15 of 15

Page 1