Zobrazeno 1 - 8
of 8
pro vyhledávání: '"Khidir R. Sharaf"'
Autor:
Gohdar H. Mohiaddin, Khidir R. Sharaf
Publikováno v:
Science Journal of University of Zakho, Vol 7, Iss 4 (2019)
In geographic, the eigenvalues and eigenvectors of transportation network provides many informations about its connectedness. It is proven that the more highly connected in a transportation network G has largest eigenvalue and hence more multiple occ
Externí odkaz:
https://doaj.org/article/4abdebf56d774230ad311d48b671f12a
Autor:
Khidir R. Sharaf, Didar A. Ali
Publikováno v:
Science Journal of University of Zakho, Vol 1, Iss 2, Pp 854-861 (2013)
Let the weight w of an edge e= uv={u,v} of a graph G be defined by w(e)=deg(u)+deg(v)-2 and the weight of G be defined by w(G)= ∑ e ∈ E(G)w(e), where E(G) is the edge set of G. In this paper the weights of joins, sequential joins, unions, interse
Externí odkaz:
https://doaj.org/article/6c39eae940474789990b84ff92fa7a55
Publikováno v:
Ars mathematica contemporanea
Two connected labelled graphs H1 and H2 of nullity one, with identical one-vertex deleted subgraphs H1 − z1 and H2 − z2 and having a common eigenvector in the nullspace of their 0-1 adjacency matrix, can be overlaid to produce the superimposition
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::90011b809aaa95bf8f399728367dc46f
https://www.um.edu.mt/library/oar/handle/123456789/65150
https://www.um.edu.mt/library/oar/handle/123456789/65150
Publikováno v:
Czechoslovak Mathematical Journal. 66:971-985
The nullity of a graph G is the multiplicity of zero as an eigenvalue in the spectrum of its adjacency matrix. From the interlacing theorem, derived from Cauchy’s inequalities for matrices, a vertex of a graph can be a core vertex if, on deleting t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8938912204bf487dab701cc1dce0c65e
https://doi.org/10.1007/s10587-016-0304-8
https://doi.org/10.1007/s10587-016-0304-8
Autor:
Gohdar H. Mohiaddin, Khidir R. Sharaf
Publikováno v:
2018 International Conference on Advanced Science and Engineering (ICOASE).
For the adjacency matrix A of a graph G, a number λ is an eigenvalue of G if for some non zerovector X, AX=λX. The vector X is called the eigenvector corresponding to λ. The eigenvalues are exactly those numbers λ that make the matrix A-λI to be
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b4769aa7df9a15e10ab75901dcda688a
https://doi.org/10.1109/icoase.2018.8548811
https://doi.org/10.1109/icoase.2018.8548811
Publikováno v:
Journal of Zankoy Sulaimani - Part A. 18:167-178
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f1422df5af6fd8e6bf99b148e6b4ad6c
https://doi.org/10.17656/jzs.10461
https://doi.org/10.17656/jzs.10461
Autor:
Khidir R. Sharaf, Didar A. Ali
Publikováno v:
Al-Rafidain Journal of Computer Sciences and Mathematics, Vol 10, Iss 4, Pp 71-86 (2013)
In this paper, a high zero-sum weighting is applied to evaluate the nullity of a dendrimer graph for some special graphs such as cycles, paths, complete graphs, complete bipartite graphs and star graphs. Finally, we introduce and prove a sharp lower
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c849d70137926fe12cf4f45c983ade3b
https://csmj.mosuljournals.com/article_163548_72b8cf0841eee8bc0330f113e2333a91.pdf
https://csmj.mosuljournals.com/article_163548_72b8cf0841eee8bc0330f113e2333a91.pdf
Autor:
Khidir R. Sharaf, Didar A. Ali
The nullity η(G) of a graph is the occurrence of zero as an eigenvalue in its spectra. A zero-sum weighting of a graph G is real valued function, say f from vertices of G to the set of real numbers, provided that for each vertex of G the summation o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::06da7e55ad2aff11c9b5ec35085bcb98