Zobrazeno 1 - 10
of 14
pro vyhledávání: '"Phillip A. Ostrand"'
Autor:
Phillip A. Ostrand
Publikováno v:
Linear and Multilinear Algebra. 2:25-38
The cutting number of a point of a connected graph is a measure of the extent to which the removal of that point cuts the graph. The cutting center of the graph is the set of points of maximal cutting number. In an earlier paper [1] all possible stru
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::89f1aa00bb39ab94abf5503f5f53c9cb
https://doi.org/10.1080/03081087408817039
https://doi.org/10.1080/03081087408817039
Publikováno v:
Fundamenta Mathematicae. 125:125-131
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2da76ea5f2161636f11ba929784aacf9
https://doi.org/10.4064/fm-125-2-125-131
https://doi.org/10.4064/fm-125-2-125-131
Publikováno v:
Discrete Mathematics. 32:99-103
This study explores the structure of graphs which together with their complements are edge symmetric.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::53450c06404567f85aff6689dc3838f3
https://doi.org/10.1016/0012-365x(80)90048-5
https://doi.org/10.1016/0012-365x(80)90048-5
Autor:
Phillip A. Ostrand, Charles A. Akemann
Publikováno v:
Journal of the London Mathematical Society. :525-530
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0bc80d098f677adeeb741b67eda9d882
https://doi.org/10.1112/jlms/s2-13.3.525
https://doi.org/10.1112/jlms/s2-13.3.525
Publikováno v:
Fundamenta Mathematicae. 122:1-21
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a6f8914fe98665d700544a37ca6f2590
https://doi.org/10.4064/fm-122-1-1-21
https://doi.org/10.4064/fm-122-1-1-21
Autor:
Phillip A. Ostrand
Publikováno v:
Bulletin of the American Mathematical Society. 71:619-622
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cc13a95816a1360d26709c53e2355971
https://doi.org/10.1090/s0002-9904-1965-11363-5
https://doi.org/10.1090/s0002-9904-1965-11363-5
Autor:
Phillip A. Ostrand
Publikováno v:
General Topology and its Applications. 1:209-221
In the usual development of dimension theory in metric spaces, the equivalence of covering and large inductive dimension plays a central role. In this paper we develope the basic theory of dimension directly from the notion of covering dimension. Sev
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::51286bb17fd5cc1caf4ccc00b1cf1a48
https://doi.org/10.1016/0016-660x(71)90093-6
https://doi.org/10.1016/0016-660x(71)90093-6
Autor:
Phillip A. Ostrand
Publikováno v:
Journal of Mathematical Analysis and Applications. 40:207-213
We present an elementary proof of a transfinite symmetric form of Philip Hall's theorem on systems of distinct representatives and derive some wellknown mapping theorems from it to illustrate the ease with which this form of the theorem may be used.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b1896d3ca81ed3df6660bcb7ba45ca9d
https://doi.org/10.1016/0022-247x(72)90044-3
https://doi.org/10.1016/0022-247x(72)90044-3
Autor:
Phillip A. Ostrand
Publikováno v:
Journal of Mathematical Analysis and Applications. 32(1):1-4
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d6681f0236e075c25c2371cb0a502fa1
Autor:
Phillip A. Ostrand
Publikováno v:
Discrete Mathematics. (1):71-75
The radius and diameter of a graph are known to satisfy the relation rad G ≤ diam G ≤ 2 rad G. We show that this is the only restriction on these parameters and construct all non-isomorphic graphs of minimal order having a specified radius and di
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0b33699dd049e72c1a0d61039e222341