{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,6]],"date-time":"2025-02-06T05:26:07Z","timestamp":1738819567380,"version":"3.37.0"},"reference-count":23,"publisher":"Academy Publisher","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["JNW"],"DOI":"10.4304\/jnw.8.2.365-372","type":"journal-article","created":{"date-parts":[[2013,3,4]],"date-time":"2013-03-04T13:18:03Z","timestamp":1362403083000},"source":"Crossref","is-referenced-by-count":2,"title":["On Nonnegative Signed Domination in Graphs and its Algorithmic Complexity"],"prefix":"10.4304","volume":"8","author":[{"given":"Zhongsheng","family":"Huang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wensheng","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhifang","family":"Feng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Huaming","family":"Xing","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"2838","published-online":{"date-parts":[[2013,2,1]]},"reference":[{"key":"ref1","volume-title":"Graphs and Digraphs","author":"Chartrand","year":"1986","unstructured":"[1]G. Chartrand, L. Lesniak, Graphs and Digraphs, second ed. Wadsworth and Brooks Cole, Monterey, 1986."},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1038\/nrg1272"},{"key":"ref3","first-page":"200","volume-title":"Proceedings of the 2005 International Conference on Data Mining (DMIN 05)","author":"Emmert-Streib","year":"2005","unstructured":"[3]F. Emmert-Streib, M. Dehmer, J. Kilian, \"Classi\ufb01cation of large graphs by a local tree decomposition in: H.R. Arabnia,\" A. Scime(Eds.), Proceedings of the 2005 International Conference on Data Mining (DMIN'05), pp. 200\u2013207, 2005."},{"key":"ref4","first-page":"67","article-title":"Web corpus mining by instance of wikipedia","volume-title":"Proceedings of the EACL 2006Workshop onWeb as Corpus","author":"Gleim","year":"2006","unstructured":"[5]R. Gleim, A.Mehler,M. Dehmer, \"Web corpus mining by instance of wikipedia,\" in: Proceedings of the EACL 2006Workshop onWeb as Corpus, Trento\/Italy, pp. 67\u201374, 2006."},{"key":"ref5","first-page":"311","article-title":"Signed Domination in Graphs","volume":"1","author":"Dunbar","year":"1995","unstructured":"[7]J.E. Dunbar, S.T. Hedetniemi, M.A. Henning and P.J. Slater, \"Signed Domination in Graphs,\" Combinatorics, Graph Theory, Applications, vol.1, pp. 311\u2013322, 1995.","journal-title":"Combinatorics Graph Theory Applications"},{"key":"ref6","first-page":"101","article-title":"On the Algorithmic Complexity of Signed Domination in Graphs","volume":"12","author":"Hattingh","year":"1995","unstructured":"[8]J.H. Hattingh, M.A. Henning and P.J. Slater, \"On the Algorithmic Complexity of Signed Domination in Graphs,\" Australas. J. Combin., vol.12, pp.101\u2013112, 1995.","journal-title":"Australas J Combin"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(96)00026-X"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1002\/0470073047"},{"key":"ref9","first-page":"67","article-title":"Structural Similarity of Directed Universal Hierarchical Graphs: A Low Computa-tional Complexity Approach","volume":"194","author":"Dehmer","year":"2006","unstructured":"[11]M. Dehmer and F. Emmert-Streib, \"Structural Similarity of Directed Universal Hierarchical Graphs: A Low Computa-tional Complexity Approach,\" Apllied Mathematics and Computation, vol.194, pp. 67\u201374, 2006.","journal-title":"Appl Math Comput","ISSN":"https:\/\/id.crossref.org\/issn\/0096-3003","issn-type":"print"},{"key":"ref10","article-title":"Towards structure-sensitive hypertext categorization","volume-title":"Proceedings of the 29th Annual Conference of the German Classi\ufb01cation Society Magde-burg","author":"Mehler","year":"2005","unstructured":"[12]A. Mehler, R. Gleim, M. Dehmer, \"Towards structure-sensitive hypertext categorization,\"in: Proceedings of the 29th Annual Conference of the German Classi\ufb01cation Society, Magde-burg, Germany, 2005."},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1038\/nrg1272"},{"key":"ref12","volume-title":"Structural Models An Introduction to the Theory of Directed Graphs","author":"Harary","year":"1965","unstructured":"[14]F. Harary, Structural Models. An Introduction to the Theory of Directed Graphs, Wiley, New York, 1965."},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2009.08.002"},{"key":"ref14","first-page":"15","article-title":"The Signed Total Domination Number of Graphs","volume":"98","author":"Gao","year":"2011","unstructured":"[16]M.J. Gao and E.F. Shan, \"The Signed Total Domination Number of Graphs,\" ARS Combinatoria, vol.98, pp. 15\u201324, 2011.","journal-title":"ARS Combinatoria"},{"key":"ref15","first-page":"213","article-title":"A Note on Signed Total 2-independence in Graphs","volume":"85","author":"Wang","year":"2011","unstructured":"[17]H.C. Wang, J. Tong and L. Volkmann, \"A Note on Signed Total 2-independence in Graphs,\" Utilitas Mathematica, vol.85, pp.213\u2013223, 2011.","journal-title":"Utilitas Mathematica"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1090\/conm\/531\/10455"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.5486\/PMD.2011.4826"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2010.03.030"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/s00010-011-0077-y"},{"key":"ref20","first-page":"129","article-title":"Signed and minus total domination on subclasses of bipartite graphs","volume":"100","author":"Lee","year":"2011","unstructured":"[22]C.M. Lee, \"Signed and minus total domination on subclasses of bipartite graphs,\" Ars Combinatora, vol.100, pp.129\u2013149, 2011.","journal-title":"Ars Combinatora"},{"key":"ref21","volume-title":"\"Fast Turing Reductions Between Problems in NP 4 \" Report 71","author":"Dewdney","year":"1981","unstructured":"[23]A.K. Dewdney, \"Fast Turing Reductions Between Problems in NP 4,\" Report 71, University of Western Ontario., 1981."},{"key":"ref21","doi-asserted-by":"crossref","unstructured":"[4]A.L. Baraba \u00b4si, H. Jeong, Z. Neda, E. Ravasz, A. Schubert, T. Vicsek, \"Evolution of the social network of scienti\ufb01c collaborations, \" Physica, vol. A 311, pp. 590\u2013614, 2002.","DOI":"10.1016\/S0378-4371(02)00736-7"},{"key":"ref21","unstructured":"[6]A. Mehler, \"in: Search of a Bridge between Network Analysis in Computational Linguistics and Computational Biology-A Conceptual Note,\" In: Proceedings of the 2006 International Conference on Bioinformatics & Computational Biology (BIO-COMP'06), Las Vegas\/USA, pp. 496\u2013500, 2006."}],"container-title":["Journal of Networks"],"original-title":[],"deposited":{"date-parts":[[2025,2,5]],"date-time":"2025-02-05T17:14:09Z","timestamp":1738775649000},"score":1,"resource":{"primary":{"URL":"https:\/\/dblp.org\/db\/journals\/jnw\/index.html"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,2,1]]},"references-count":23,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2013,2,1]]}},"URL":"https:\/\/doi.org\/10.4304\/jnw.8.2.365-372","relation":{},"ISSN":["1796-2056"],"issn-type":[{"type":"print","value":"1796-2056"}],"subject":[],"published":{"date-parts":[[2013,2,1]]}}}