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

Page 1

Displaying 1 – 17 of 17

Showing per page

Matrices induced by arithmetic functions, primes and groupoid actions of directed graphs

Ilwoo Cho, Palle E. T. Jorgensen (2015)

Special Matrices

In this paper, we study groupoid actions acting on arithmetic functions. In particular, we are interested in the cases where groupoids are generated by directed graphs. By defining an injective map α from the graph groupoid G of a directed graph G to the algebra A of all arithmetic functions, we establish a corresponding subalgebra AG = C*[α(G)]︀ of A. We construct a suitable representation of AG, determined both by G and by an arbitrarily fixed prime p. And then based on this representation, we...

Minimal c p rank.

Shaked-Monderer, Naomi (2001)

ELA. The Electronic Journal of Linear Algebra [electronic only]

Monochromatic cycles and monochromatic paths in arc-colored digraphs

Hortensia Galeana-Sánchez, Guadalupe Gaytán-Gómez, Rocío Rojas-Monroy (2011)

Discussiones Mathematicae Graph Theory

We call the digraph D an m-colored digraph if the arcs of D are colored with m colors. A path (or a cycle) is called monochromatic if all of its arcs are colored alike. A cycle is called a quasi-monochromatic cycle if with at most one exception all of its arcs are colored alike. A subdigraph H in D is called rainbow if all its arcs have different colors. 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...

Monochromatic kernel-perfectness of special classes of digraphs

Hortensia Galeana-Sánchez, Luis Alberto Jiménez Ramírez (2007)

Discussiones Mathematicae Graph Theory

In this paper, we introduce the concept of monochromatic kernel-perfect digraph, and we prove the following two results: (1) If D is a digraph without monochromatic directed cycles, then D and each α v , v ∈ V ( D ) are monochromatic kernel-perfect digraphs if and only if the composition over D of ( α v ) v ∈ V ( D ) is a monochromatic kernel-perfect digraph. (2) D is a monochromatic kernel-perfect digraph if and only if for any B ⊆ V(D), the duplication of D over B, D B , is a monochromatic kernel-perfect digraph.

Monochromatic paths and monochromatic sets of arcs in 3-quasitransitive digraphs

Hortensia Galeana-Sánchez, R. Rojas-Monroy, B. Zavala (2009)

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 is called monochromatic if all of its arcs are coloured alike. A set N of vertices of D is called a kernel by monochromatic paths if for every pair of vertices of N there is no monochromatic path between them and for every vertex v ∉ N there is a monochromatic path from v to N. We denote by A⁺(u) the set of arcs of D that have u as the initial vertex. We prove that if D is an m-coloured 3-quasitransitive...

Monochromatic paths and monochromatic sets of arcs in bipartite tournaments

Hortensia Galeana-Sánchez, R. Rojas-Monroy, B. Zavala (2009)

Discussiones Mathematicae Graph Theory

We call the digraph D an m-coloured digraph if the arcs of D are coloured with m colours and all of them are used. A directed path is called monochromatic if all of its arcs are coloured alike. A set N of vertices of D is called a kernel by monochromatic paths if for every pair of vertices there is no monochromatic path between them and for every vertex v in V(D)∖N there is a monochromatic path from v to some vertex in N. We denote by A⁺(u) the set of arcs of D that have u as the initial...

Monochromatic paths and monochromatic sets of arcs in quasi-transitive digraphs

Hortensia Galeana-Sánchez, R. Rojas-Monroy, B. Zavala (2010)

Discussiones Mathematicae Graph Theory

Let D be a digraph, V(D) and A(D) will denote the sets of vertices and arcs of D, respectively. We call the digraph D an m-coloured digraph if each arc of D is coloured by an element of {1,2,...,m} where m ≥ 1. A directed path is called monochromatic if all of its arcs are coloured alike. A set N of vertices of D is called a kernel by monochromatic paths if there is no monochromatic path between two vertices of N and if for every vertex v not in N there is a monochromatic path from v to some vertex...

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...

Currently displaying 1 – 17 of 17

Page 1