THE RELATION BETWEEN TOPOLOGICAL ORDERING AND ADJACENCY MATRIX IN DIGRAPHS
نویسندگان
چکیده مقاله:
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 adjacency matrix in acyclic digraphs are presented.
منابع مشابه
On Digraphs with Non-derogatory Adjacency Matrix
Let G be a digraph with n vertices and A(G) be its adjacency matrix. A monic polynomial f(x) of degree at most n is called an annihilating polynomial of G if . 0 )) ( ( = G A f G is said to be annihilatingly unique if it possesses a unique annihilating polynomial. We prove that two families of digraphs, i.e., the ladder digraphs and the difans, are annihilatingly unique by studying the similari...
متن کاملthe relationship between learners critical thinking ability and their performance in the reading sections of the tofel and ielts test
the study reflected in this thesis aims at finding out relationships between critical thinking (ct), and the reading sections of tofel and ielts tests. the study tries to find any relationships between the ct ability of students and their performance on reading tests of tofel and academic ielts. however, no research has ever been conducted to investigate the relationship between ct and the read...
15 صفحه اولthe relation between bilingualism and translation: a case study of turkish bilingual and persian monolingual translation students
translation studies have become an accepted academic subject and books, journals and doctoral dissertations appear faster than one can read them all (bassnet and lefevere, 1990). but this field also brought with itself so many other issues which needed to be investigated more, in the heart of which, issues like ideology, ethics, culture, bilingualism and multilingualism. it is reported that ove...
The topological ordering of covering nodes
The topological ordering algorithm sorts nodes of a directed graph such that the order of the tail of each arc is lower than the order of its head. In this paper, we introduce the notion of covering between nodes of a directed graph. Then, we apply the topological orderingalgorithm on graphs containing the covering nodes. We show that there exists a cut set withforward arcs in these...
متن کاملthe relationship between academic self-concept and academic achievement in english and general subjects of the students of high school
according to research, academic self-concept and academic achievement are mutually interdependent. in the present study, the aim was to determine the relationship between the academic self-concept and the academic achievement of students in english as a foreign language and general subjects. the participants were 320 students studying in 4th grade of high school in three cities of noor, nowshah...
Well-quasi-ordering graphs by the topological minor relation
Robertson and Seymour proved that graphs are well-quasi-ordered by the minor relation and the weak immersion relation in the prominent Graph Minors series. That is, given infinitely many graphs, one graph contains another as a minor (or a weak immersion, respectively). However, the topological minor relation does not well-quasi-order graphs. For every positive integer i, let Gi be the graph obt...
متن کاملمنابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ذخیره در منابع من قبلا به منابع من ذحیره شده{@ msg_add @}
عنوان ژورنال
دوره 2 شماره 1 (WINTER)
صفحات 71- 75
تاریخ انتشار 2012-12-21
با دنبال کردن یک ژورنال هنگامی که شماره جدید این ژورنال منتشر می شود به شما از طریق ایمیل اطلاع داده می شود.
کلمات کلیدی
میزبانی شده توسط پلتفرم ابری doprax.com
copyright © 2015-2023