{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,11,13]],"date-time":"2023-11-13T00:07:45Z","timestamp":1699834065380},"reference-count":7,"publisher":"Wiley","issue":"2","license":[{"start":{"date-parts":[[2006,10,11]],"date-time":"2006-10-11T00:00:00Z","timestamp":1160524800000},"content-version":"vor","delay-in-days":10359,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Networks"],"published-print":{"date-parts":[[1978,6]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>This work extends the results of M. Rosenfeld [6] on universal graphs with respect to the strong graph product. By using a generalized measure of independence, one can get improved bounds on the growth of the maximum independent set size under this graph product. Furthermore, a necessary and sufficient condition is derived for when the maximum independent set of the product graph is strictly greater than the product of the maximum independent sets.<\/jats:p>","DOI":"10.1002\/net.3230080206","type":"journal-article","created":{"date-parts":[[2007,5,11]],"date-time":"2007-05-11T08:48:46Z","timestamp":1178873326000},"page":"135-151","source":"Crossref","is-referenced-by-count":5,"title":["A generalized measure of independence and the strong product of graphs"],"prefix":"10.1002","volume":"8","author":[{"given":"B. H.","family":"Barnes","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"K. E.","family":"Mackey","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2006,10,11]]},"reference":[{"key":"e_1_2_1_2_2","first-page":"25","volume-title":"Automata Theory","author":"Berge C.","year":"1966"},{"key":"e_1_2_1_3_2","first-page":"38","volume-title":"The Theory of Graphs","author":"Berge C.","year":"1966"},{"key":"e_1_2_1_4_2","unstructured":"Hales R. S. \u201cNumerical Invariants and Gamma Products of Graphs \u201d Ph. D. Thesis Department of\u2010Mathematics Harvard University 1970."},{"key":"e_1_2_1_5_2","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(73)90014-2"},{"key":"e_1_2_1_6_2","unstructured":"Laubscher W. A. \u201cA Study of the Zero Error Capacity in a Noisy Channel \u201d M. S. Thesis Department of Computer Science The Pennsylvania State University 1967."},{"key":"e_1_2_1_7_2","doi-asserted-by":"publisher","DOI":"10.2307\/2035288"},{"key":"e_1_2_1_8_2","doi-asserted-by":"crossref","unstructured":"Shannon C. E. \u201cThe Zero Error Capacity of a Noisy Channel \u201d Trans.1956Symp.Inform. Theory IRE IT\u20102 pp.8\u201319.","DOI":"10.1109\/TIT.1956.1056798"}],"container-title":["Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fnet.3230080206","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/net.3230080206","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,12]],"date-time":"2023-11-12T08:35:48Z","timestamp":1699778148000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/net.3230080206"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1978,6]]},"references-count":7,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1978,6]]}},"alternative-id":["10.1002\/net.3230080206"],"URL":"https:\/\/doi.org\/10.1002\/net.3230080206","archive":["Portico"],"relation":{},"ISSN":["0028-3045","1097-0037"],"issn-type":[{"value":"0028-3045","type":"print"},{"value":"1097-0037","type":"electronic"}],"subject":[],"published":{"date-parts":[[1978,6]]}}}