Zobrazeno 1 - 3
of 3
pro vyhledávání: '"Lachniet, Jason"'
Autor:
Lachniet, Jason
Publikováno v:
Electronic Theses and Dissertations.
For a graph G=(V,E), a nonempty subset S contained in V is called a defensive alliance if for each v in S, there are at least as many vertices from the closed neighborhood of v in S as in V-S. If there are strictly more vertices from the closed neigh
Externí odkaz:
https://dc.etsu.edu/etd/2080
https://dc.etsu.edu/context/etd/article/3441/viewcontent/LachnietJ041007f.PDF
https://dc.etsu.edu/context/etd/article/3441/viewcontent/LachnietJ041007f.PDF
Autor:
Terry, Christine H., Kinniburgh, Garnett, Browder, Robert, DeCarlo, Matthew, Becksford, Lisa, McNabb, Kayla B., Lachniet, Jason, Hipple, Britton, Maczka, Darren, Donnelly, Sarah, Ireland, Leanna, Erickson, Sue
Faculty, instructional designers, graduate students, and librarians from six institutions of higher education will briefly present an overview of peer-reviewed posters on diverse topics including: Creating open educational resources, linking open edu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______2485::a4fd47e18c7b6b402d7e1fb6511d1bde
https://hdl.handle.net/10919/87776
https://hdl.handle.net/10919/87776
Publikováno v:
AKCE International Journal of Graphs and Combinatorics; January 2007, Vol. 4 Issue: 1 p51-59, 9p