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

Displaying 141 – 160 of 183

Showing per page

Monochromatic paths and quasi-monochromatic cycles in edge-coloured bipartite tournaments

Hortensia Galeana-Sanchez, Rocío Rojas-Monroy (2008)

Discussiones Mathematicae Graph Theory

We call the digraph D an m-coloured digraph if the arcs of D are coloured with m colours. A directed path (or a directed cycle) is called monochromatic if all of its arcs are coloured alike. A directed cycle is called quasi-monochromatic if with at most one exception all of its arcs are coloured alike. A set N ⊆ V(D) is said to be a kernel by monochromatic paths if it satisfies the following two conditions: (i) for every pair of different vertices u,v ∈ N there is no monochromatic...

Monomial subdigraphs of reachable and controllable positive discrete-time systems

Rafael Bru, Louis Caccetta, Ventsi Rumchev (2005)

International Journal of Applied Mathematics and Computer Science

A generic structure of reachable and controllable positive linear systems is given in terms of some characteristic components (monomial subdigraphs) of the digraph of a non-negative a pair. The properties of monomial subdigraphs are examined and used to derive reachability and controllability criteria in a digraph form for the general case when the system matrix may contain zero columns. The graph-theoretic nature of these criteria makes them computationally more efficient than their known equivalents....

Monomorphisms in spaces with Lindelöf filters

Richard N. Ball, Anthony W. Hager (2007)

Czechoslovak Mathematical Journal

𝐒𝐩𝐅𝐢 is the category of spaces with filters: an object is a pair ( X , ℱ ) , X a compact Hausdorff space and ℱ a filter of dense open subsets of X . A morphism f ( Y , 𝒢 ) → ( X , ℱ ) is a continuous function f Y → X for which f - 1 ( F ) ∈ 𝒢 whenever F ∈ ℱ . This category arises naturally from considerations in ordered algebra, e.g., Boolean algebra, lattice-ordered groups and rings, and from considerations in general topology, e.g., the theory of the absolute and other covers, locales, and frames, though we shall specifically address only one of these...

Monte Carlo simulation and analytic approximation of epidemic processes on large networks

Noémi Nagy, Péter Simon (2013)

Open Mathematics

Low dimensional ODE approximations that capture the main characteristics of SIS-type epidemic propagation along a cycle graph are derived. Three different methods are shown that can accurately predict the expected number of infected nodes in the graph. The first method is based on the derivation of a master equation for the number of infected nodes. This uses the average number of SI edges for a given number of the infected nodes. The second approach is based on the observation that the epidemic...

Moore-Penrose inverse of a hollow symmetric matrix and a predistance matrix

Hiroshi Kurata, Ravindra B. Bapat (2016)

Special Matrices

By a hollow symmetric matrix we mean a symmetric matrix with zero diagonal elements. The notion contains those of predistance matrix and Euclidean distance matrix as its special cases. By a centered symmetric matrix we mean a symmetric matrix with zero row (and hence column) sums. There is a one-toone correspondence between the classes of hollow symmetric matrices and centered symmetric matrices, and thus with any hollow symmetric matrix D we may associate a centered symmetric matrix B, and vice...

More on betweenness-uniform graphs

Jana Coroničová Hurajová, Tomáš Madaras (2018)

Czechoslovak Mathematical Journal

We study graphs whose vertices possess the same value of betweenness centrality (which is defined as the sum of relative numbers of shortest paths passing through a given vertex). Extending previously known results of S. Gago, J. Hurajová, T. Madaras (2013), we show that, apart of cycles, such graphs cannot contain 2-valent vertices and, moreover, are 3-connected if their diameter is 2. In addition, we prove that the betweenness uniformity is satisfied in a wide graph family of semi-symmetric graphs,...

More on even [a,b]-factors in graphs

Abdollah Khodkar, Rui Xu (2007)

Discussiones Mathematicae Graph Theory

In this note we give a characterization of the complete bipartite graphs which have an even (odd) [a,b]-factor. For general graphs we prove that an a-edge connected graph G with n vertices and with δ(G) ≥ max{a+1,an/(a+b) + a - 2} has an even [a,b]-factor, where a and b are even and 2 ≤ a ≤ b. With regard to the edge-connectivity this result is slightly better than one of the similar results obtained by Kouider and Vestergaard in 2004 and unlike their results, this result has no restriction on the...

More on the girth of graphs on Weyl groups

Samy A. Youssef, S. G. Hulsurkar (1993)

Archivum Mathematicum

The girth of graphs on Weyl groups, with no restriction on the associated root system, is determined. It is shown that the girth, when it is defined, is 3 except for at most four graphs for which it does not exceed 4.

Currently displaying 141 – 160 of 183