نتایج جستجو برای: digraphs

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

Two digraphs of same order are said to be skew-equienergetic if their skew energies are equal. One of the open problems proposed by Li and Lian was to construct non-cospectral skew-equienergetic digraphs on n vertices. Recently this problem was solved by Ramane et al. In this  paper, we give some new methods to construct new skew-equienergetic digraphs.

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

Journal: :communication in combinatorics and optimization 0
ch. adiga university of mysore rakshith b r university of mysore

two digraphs of same order are said to be skew-equienergetic if theirskew energies are equal. one of the open problems proposed by li andlian was to construct non-cospectral skew-equienergetic digraphs onn vertices. recently this problem was solved by ramane et al. inthis paper, we give some new methods to construct new skew-equienergeticdigraphs.

N. Delfan T. Rastad

In this paper the properties of node-node adjacency matrix in acyclic digraphs are considered. It is shown that topological ordering and node-node adjacency matrix are closely related. In fact, first the one to one correspondence between upper triangularity of node-node adjacency matrix and existence of directed cycles in digraphs is proved and then with this correspondence other properties of ...

Journal: :Discrete Mathematics 2002
Ding-Zhu Du D. Frank Hsu Hung Q. Ngo G. W. Peck

The concept of a consecutive-d digraph was proposed by Du, Hsu and Hwang as a generalization of de Bruijn digraphs, Kautz digraphs, and their generalizations given by Imase and Itoh and Reddy, Pradhan and Kuhl. In this paper we determine the connectivity of consecutive-d digraphs and study how to modify consecutive-d digraphs to reach maximum connectivity. Our results will generalize and improv...

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

Journal: :Electronic Notes in Discrete Mathematics 2009
Hortensia Galeana-Sánchez Ilan A. Goldfeder

Tournaments are without doubt the best studied class of directed graphs [3, 6]. The generalizations of tournaments arise in order to extend the well-known results on tournaments to more general classes of directed graphs. Moreover, the knowledge about generalizations of tournaments has allowed to deepen our understanding of tournaments themselves. The semicomplete digraphs, the semicomplete mul...

2017
MEHTAB KHAN RASHID FAROOQ

Among unicyclic digraphs and signed digraphs with fixed number of vertices, the digraphs and signed digraphs with minimal and maximal energy are already determined. In this paper we address the problem of finding bicyclic signed digraphs with extremal energy. We obtain minimal and maximal energy among all those n -vertex bicyclic signed digraphs which contain vertex-disjoint signed directed cyc...

Journal: :Journal of Graph Theory 2014
Jørgen Bang-Jensen Alessandro Maddaloni

4 We prove that the weak k-linkage problem is polynomial for every fixed k for totally Φ5 decomposable digraphs, under appropriate hypothesis on Φ. We then apply this and recent results 6 by Fradkin and Seymour (on the weak k-linkage problem for digraphs of bounded independence 7 number or bounded cut-width) to get polynomial algorithms for some class of digraphs like quasi8 transitive digraphs...

2006
Bo Zhou

We obtain upper bounds for the upper generalized exponents of digraphs in the class of ministrong digraphs and in the class of non-primitive ministrong digraphs, characterize the corresponding extremal digraphs, and discuss the numbers attainable as upper generalized exponents of ministrong digraphs.

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

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