Zobrazeno 1 - 10
of 23
pro vyhledávání: '"Yousef Alavi"'
Publikováno v:
فقه و حقوق خانواده, Vol 26, Iss 74, Pp 271-251 (2021)
Marriage is the foundation for family and family is the foundation on which society stands. Marriage established by the Holy Shari'a in order to make it permissible as a solution for both men and women to enjoy each other to create a matrimonial rela
Externí odkaz:
https://doaj.org/article/5877256a3dad4552a84178421161878f
Publikováno v:
Graphs and Combinatorics. 18:709-715
Let G be a (V,E) graph of order p≥2. The double vertex graph U 2 (G) is the graph whose vertex set consists of all 2-subsets of V such that two distinct vertices {x,y} and {u,v} are adjacent if and only if |{x,y}∩{u,v}|=1 and if x=u, then y and v
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::79265e436b4709edab26bf876d707bc6
https://doi.org/10.1007/s003730200055
https://doi.org/10.1007/s003730200055
Publikováno v:
Journal of Graph Theory. 18:315-322
The linear vertex-arboricity ρ(G) of a graph G is defined to be the minimum number of subsets into which the vertex set of G can be partitioned such that each subset induces a linear forest. In this paper, we give the sharp upper and lower bounds fo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1185b1e379e65edad9d739863ab6ebf1
https://doi.org/10.1002/jgt.3190180309
https://doi.org/10.1002/jgt.3190180309
Publikováno v:
Discrete Mathematics. 111(1-3):3-10
A connected digraph D is highly irregular if the vertices of out-neighborhood of each vertex vϵV(D) have different out-degrees. In this paper, we investigate some problems concerning the existence of highly irregular digraphs with special properties
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6740918b4eb9e7a83ead74f5f829e3f6
Publikováno v:
Discrete Mathematics. 100:229-233
A total cover of a graph G is a subset of V(G)∪E(G) which covers all elements of V(G)∪E(G). The total covering number α2(G) of a graph G is the minimum cardinality of a total cover in G. In [1], it is proven that α2(G)⩽[n2] for a connected gr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7a71c6a08a6024c6db7762851c14eaa4
https://doi.org/10.1016/0012-365x(92)90643-t
https://doi.org/10.1016/0012-365x(92)90643-t
Autor:
Yousef Alavi, Po-Fang Hsieh
Publikováno v:
Trends and Developments in Ordinary Differential Equations.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c6cc35ee51f9897de49d26d2991531ce
https://doi.org/10.1142/9789814535212
https://doi.org/10.1142/9789814535212
Publikováno v:
Electronic Notes in Discrete Mathematics. 11:761-762
The Ninth Quadrennial International Conference on Graph Theory, Combinatorics, Algorithms and Applications was held June 4-9, 2000 at Western Michigan University. This conference has been held every four years since 1968, hosted by the Department of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5d7b44781a497582ebb55b7f35250454
https://doi.org/10.1016/s1571-0653(05)80007-1
https://doi.org/10.1016/s1571-0653(05)80007-1
Publikováno v:
Bulletin of the Australian Mathematical Society. 25:187-206
A graph G, every vertex of which has degree at least three, is randomly 3-axial if for each vertex v of G, any ordered collection of three paths in G of length one with initial vertex v can be cyclically randomly extended to produce three internally
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6a8cbdd03a842062e744cc8d3ff3df46
https://doi.org/10.1017/s0004972700005207
https://doi.org/10.1017/s0004972700005207
Publikováno v:
Journal of Graph Theory. 11:235-249
A connected graph is highly irregular if each of its vertices is adjacent only to vertices with distinct degrees. In this paper we investigate several problems concerning the existence and enumeration of highly irregular graphs as well as their indep
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4178d0420c706d70b04e25854df88bbc
https://doi.org/10.1002/jgt.3190110214
https://doi.org/10.1002/jgt.3190110214
Publikováno v:
Journal of Graph Theory. 1:135-140
In graph theory, the related problems of deciding when a set of vertices or a set of edges constitutes a maximum matching or a minimum covering have been extensively studied. In this paper we generalize these ideas by defining total matchings and tot
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::37529c46ce71875f9e61d0b626e56c3f
https://doi.org/10.1002/jgt.3190010209
https://doi.org/10.1002/jgt.3190010209