Displaying 381 – 400 of 501

Showing per page

Self-diclique circulant digraphs

Marietjie Frick, Bernardo Llano, Rita Zuazua (2015)

Mathematica Bohemica

We study a particular digraph dynamical system, the so called digraph diclique operator. Dicliques have frequently appeared in the literature the last years in connection with the construction and analysis of different types of networks, for instance biochemical, neural, ecological, sociological and computer networks among others. Let D = ( V , A ) be a reflexive digraph (or network). Consider X and Y (not necessarily disjoint) nonempty subsets of vertices (or nodes) of D . A disimplex K ( X , Y ) of D is the subdigraph...

Sharp Upper Bounds on the Signless Laplacian Spectral Radius of Strongly Connected Digraphs

Weige Xi, Ligong Wang (2016)

Discussiones Mathematicae Graph Theory

Let G = (V (G),E(G)) be a simple strongly connected digraph and q(G) be the signless Laplacian spectral radius of G. For any vertex vi ∈ V (G), let d+i denote the outdegree of vi, m+i denote the average 2-outdegree of vi, and N+i denote the set of out-neighbors of vi. In this paper, we prove that: (1) (1) q(G) = d+1 +d+2 , (d+1 ≠ d+2) if and only if G is a star digraph [...] ,where d+1, d+2 are the maximum and the second maximum outdegree, respectively [...] is the digraph on n vertices obtained...

Currently displaying 381 – 400 of 501