نتایج جستجو برای: singlesource digraph

تعداد نتایج: 2553  

2015
R. Chandrasekhar

In this paper, the digraph valued function(digraph operator), namely the block line cut vertex digraph BLC(D) of a digraph D is defined, and the problem of reconstructing a digraph from its block line cut vertex digraph is presented. Outer planarity, maximal outer planarity, and minimally non-outer planarity properties of these digraphs are discussed.

Journal: :IEICE Transactions 2008
Haruaki Onishi Yuuki Tanaka Yukio Shibata

In this paper, we present a new extension of the butterfly digraph, which is known as one of the topologies used for interconnection networks. The butterfly digraph was previously generalized from binary to d-ary. We define a new digraph by adding a signed label to each vertex of the d-ary butterfly digraph. We call this digraph the dihedral butterfly digraph and study its properties. Furthermo...

Journal: :Inf. Process. Lett. 2007
Yuuki Tanaka Hiroyuki Kawai Yukio Shibata

In this paper, we investigate isomorphic factorizations of the Kronecker product graphs. Using these relations, it is shown that (1) the Kronecker product of the d-out-regular digraph and the complete symmetric digraph is factorized into the line digraph, (2) the Kronecker product of the Kautz digraph and the de Bruijn digraph is factorized into the Kautz digraph, (3) the Kronecker product of b...

Journal: :bulletin of the iranian mathematical society 2015
j. li b. zhou

it is known that the directed cycle of order $n$ uniquely achieves the minimum spectral radius among all strongly connected digraphs of order $nge 3$. in this paper, among others, we determine the digraphs which achieve the second, the third and the fourth minimum spectral radii respectively among strongly connected digraphs of order $nge 4$.

1998
Kurt D. Fenstermacher Kristian J. Hammond

When researching a topic, users often need different kinds of information which are provided by different information sources. In developing the SINGLESOURCE application, we are building a framework for accessing multiple sources, both for querying several sources simultaneously and viewing the results in a hierarchy of related documents. We first discuss our approach to querying multiple sourc...

Journal: :journal of algebra and related topics 2014
m. karimi

let $r$ be a commutative ring. in this paper, by using algebraic properties of $r$, we study the hase digraph of prime ideals of $r$.

2002
SIMONE SEVERINI

In this note, we give a characterization of the adjacency matrix of the line digraph of a regular digraph and we discuss a generalization.On the light of the characterization given, we remark that the underlying digraph of a coined quantum random walk is the line digraph of a regular digraph. 1. A characterization of the adjacency matrix of the line digraph of a regular digraph 1.1. Set-up. The...

Journal: :transactions on combinatorics 2014
r. lakshmi s. vidhyapriya

a kernel $j$ of a digraph $d$ is an independent set of vertices of $d$ such that for every vertex $w,in,v(d),setminus,j$ there exists an arc from $w$ to a vertex in $j.$in this paper, among other results, a characterization of $2$-regular circulant digraph having a kernel is obtained. this characterization is a partial solution to the following problem: characterize circulant digraphs which hav...

2002
SIMONE SEVERINI

Study the relationship between unitary matrices and their patterns is motivated by works in quantum chaology (see, e.g., [KS99]) and quantum computation (see, e.g., [M96] and [AKV01]). We prove that if a Cayley digraph is a line digraph then it is the pattern of a unitary matrix. We prove that for any finite group with two generators there exists a set of generators such that the Cayley digraph...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید