Zobrazeno 1 - 10 of 18 pro vyhledávání: '"E. A. Nordhaus"'
1
Total matchings and total coverings of graphs
Autor: E. A. Nordhaus, Yousef Alavi, Linda M. Lesniak-Foster, M. Behzad
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
Zobrazit plný text záznamu
2
Hamiltonian path graphs
Autor: E. A. Nordhaus, Gary Chartrand, S. F. Kapoor
Publikováno v: Journal of Graph Theory. 7:419-427
The Hamiltonian path graph H(G) of a graph G is that graph having the same vertex set as G and in which two vertices u and v are adjacent if and only if G contains a Hamiltonian u-v path. A characterization of Hamiltonian graphs isomorphic to their H
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::a99a74f3b1e9f3b7fb6fbc07da4a23bb
https://doi.org/10.1002/jgt.3190070406
Zobrazit plný text záznamu
3
Minimal separating sets of maximum size
Autor: Yousef Alavi, M. Behzad, E. A. Nordhaus
Publikováno v: Journal of Combinatorial Theory, Series B. 28:180-183
A connected graph G can be disconnected or reduced to a single vertex by removing an appropriate subset of the vertex set V ( G ), and can be disconnected by removing a suitable subset of the edge set E ( G ). Attention has usually been centered on s
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::93a9876a80eee9a5555a3368700b23e4
https://doi.org/10.1016/0095-8956(80)90064-7
Zobrazit plný text záznamu
4
Brouwerian Geometry
Autor: E. A. Nordhaus, Leo Lapidus
Publikováno v: Canadian Journal of Mathematics. 6:217-229
From time to time attention has been directed to the study of spaces in which the “distances” are selected from algebraic structures other than the real or complex numbers. For example, Menger (9) and Taussky (11) have considered spaces in which
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::19f8b1d905914590db12aad4e3ebdf03
https://doi.org/10.4153/cjm-1954-023-7
Zobrazit plný text záznamu
8
Triangles in an Ordinary Graph
Autor: B. M. Stewart, E. A. Nordhaus
Publikováno v: Canadian Journal of Mathematics. 15:33-41
An ordinary graph is a finite linear graph which contains no loops or multiple edges, and in which all edges are undirected. In such a graph G, let N, L, and T denote respectively the number of nodes, edges, and triangles. One problem, suggested by P
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::8ae425d1b26b55522bae6ce5c5146046
https://doi.org/10.4153/cjm-1963-004-7
Zobrazit plný text záznamu
9
Generalizations of graphical parameters
Autor: E. A. Nordhaus
Publikováno v: Lecture Notes in Mathematics ISBN: 9783540086666
Graph theoretic parameters are often defined for a finite graph G with the aid of certain subsets of the vertex set V(G) or of the edge set E(G). One usually restricts attention to those subsets having maximum or minimum cardinality. Examples include
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::feadad73634e7a9386a8ee59ed7c6b60
https://doi.org/10.1007/bfb0070399
Zobrazit plný text záznamu

Vyhledávací nástroje:

Upřesnit hledání

Omezení vyhledávání
Plný text Recenzováno Digitální knihovna AV ČR
Zdroje