Zobrazeno 1 - 10
of 26
pro vyhledávání: '"S. F. Kapoor"'
Publikováno v:
Graphs and Combinatorics. 7:253-264
The edge-clique graphK(G) of a graphG is that graph whose vertices correspond to the edges ofG and where two vertices ofK(G) are adjacent whenever the corresponding edges ofG belong to a common clique. It is shown that every edge-clique graph is a cl
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f031e18c0721f1d22ea03bf1f675f28e
https://doi.org/10.1007/bf01787631
https://doi.org/10.1007/bf01787631
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:
Bulletin of the Australian Mathematical Society. 36:441-447
It is proved that if G is a connected cubic graph of order p all of whose bridges lie on r edge-disjoint paths of G, then every maximum matching of G contains at least P/2 − └2r/3┘ edges. Moreover, this result is shown to be best possible.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::163282d14b1b1cd8ccf662a4f1536cd8
https://doi.org/10.1017/s0004972700003737
https://doi.org/10.1017/s0004972700003737
Autor:
Linda M. Lesniak-Foster, S. F. Kapoor
Publikováno v:
Annals of the New York Academy of Sciences. 319:320-330
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1f67fffe0d6f83430b69d050d2b8627b
https://doi.org/10.1111/j.1749-6632.1979.tb32806.x
https://doi.org/10.1111/j.1749-6632.1979.tb32806.x
Publikováno v:
Bulletin of the Australian Mathematical Society. 23:143-156
A class of graphs called randomly k-axial graphs is introduced, which generalizes randomly traceable graphs. The problems of determining which bipartite graphs and which complete n-partite graphs are randomly k-axial are studied.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7fb14daf2ea9be6318608e7e8cac84aa
https://doi.org/10.1017/s0004972700006961
https://doi.org/10.1017/s0004972700006961
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
Publikováno v:
International Journal of Mathematical Education in Science and Technology. 13:243-252
This paper discusses three alternative models for structuring homework assignments in college level mathematics. A distributive model which incorporates both early and late review of previously learned material into the daily assignment schedule is e
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8e111bb1234b24db048a8afdf20bb288
https://doi.org/10.1080/0020739820130301
https://doi.org/10.1080/0020739820130301
Publikováno v:
Periodica Mathematica Hungarica. 12:261-266
For a finite nonempty set of integers, each of which is at least two, and an integern ≥ 3, the numberf( ;n) is defined as the least order of a graph having degree set and girthn. The numberf( ;n) is evaluated for several sets and integersn. In part
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7cd806530dd8c15d07c186a077712e82
https://doi.org/10.1007/bf01849614
https://doi.org/10.1007/bf01849614