{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,30]],"date-time":"2025-09-30T00:19:59Z","timestamp":1759191599417},"reference-count":23,"publisher":"EDP Sciences","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Theor. Inf. Appl."],"published-print":{"date-parts":[[2015,10]]},"DOI":"10.1051\/ita\/2016001","type":"journal-article","created":{"date-parts":[[2016,4,14]],"date-time":"2016-04-14T06:35:41Z","timestamp":1460615741000},"page":"269-284","source":"Crossref","is-referenced-by-count":5,"title":["Neighbor Isolated Tenacity of Graphs"],"prefix":"10.1051","volume":"49","author":[{"given":"Ersin","family":"Aslan","sequence":"first","affiliation":[]}],"member":"250","published-online":{"date-parts":[[2016,4,14]]},"reference":[{"key":"R1","doi-asserted-by":"crossref","unstructured":"Aslan E., Edge-neighbor-rupture degree of graphs.J. Appl. Math.2013(2013) 783610.","DOI":"10.1155\/2013\/783610"},{"key":"R2","unstructured":"Bagga K.S., Beineke L.W., Goddard W., Pippert R.E. and Lipman M.J., A survey of integrity,Discrete Appl. Math.76(1992) 13\u201328."},{"key":"R3","doi-asserted-by":"crossref","unstructured":"A. Brandst\u00e4dt, LE V.B. and J.P. Spinrad, Graph classess: a survey.SIAM Monogr. Discrete Math. Appl.Springer (1999).","DOI":"10.1137\/1.9780898719796"},{"key":"R4","unstructured":"Cozzens M.B. and Wu S.S.Y., Vertex-neighbor-integrity of trees.Ars Combin.43(1996) 169\u2013180."},{"key":"R5","unstructured":"Cozzens M.B. and Wu S.S.Y., Vertex-neighbor-integrity of powers of cycles.Ars Combin.48(1998) 257\u2013270."},{"key":"R6","unstructured":"Cozzens M.B., Moazzami D. and Stueckle S., The tenacity of the Harary Graphs.J. Combin. Math. Combin. Comput.16(1994) 33\u201356."},{"key":"R7","unstructured":"M.B. Cozzens, D. Moazzami and S. Stueckle, The Tenacity of a Graph: Graph Theory, Combinatorisc, Algorithms and Applications. Vol. 2 ofProc. of the 7th Quadrennial International Conference on the Theory and Applications of Graphs. Wiley, New York (1995) 1111\u20131122."},{"key":"R8","doi-asserted-by":"crossref","unstructured":"Gunther G., Neighbor connectivity in regular graphs.Discrete Appl. Math.11(1985) 233\u2013243.","DOI":"10.1016\/0166-218X(85)90075-7"},{"key":"R9","unstructured":"F. Harary, Graph Theory. Addison-Wesley, New York (1994)."},{"key":"R10","doi-asserted-by":"crossref","unstructured":"Jung H.A., On a class of posets and the corresponding comparability graphs.J. Combin. Theory, Series B24(1978) 125\u2013133.","DOI":"10.1016\/0095-8956(78)90013-8"},{"key":"R11","unstructured":"Kirlangic A., Graph operations and neighbor-integrity.Math. Bohem.3(2004) 245\u2013254."},{"key":"R12","unstructured":"F. Li and X. Li, Computational Complexity and Bounds for Neighbor-Scattering Number of Graphs.Proc. of the 8th International Symposium on Parallel Architectures. Algorithms and Networks(2005)."},{"key":"R13","unstructured":"Li F. and Ye Q., The size of a minimum critically m-neighbor-scattered graph.Lect. Notes Comput. Sci.4616(2007) 91\u2013101."},{"key":"R14","unstructured":"Li Y., Zhang S., Li X. and Wu Y., Relationships between tenacity and some other vulnerability parameters.Fangzhi Gaoxiao Jichukexue Xuebao17(2004) 1\u20134."},{"key":"R15","doi-asserted-by":"crossref","unstructured":"Li Y., Wei Z. and Yue X., Tenacity of total graphs.Int. J. Found. Comput. Sci.25(2014) 553\u2013562.","DOI":"10.1142\/S012905411450021X"},{"key":"R16","unstructured":"Moazzami D., On the edge-tenacity of graphs,Int. Math. Forum3(2008) 929\u2013936."},{"key":"R17","unstructured":"Moazzami D., Tenacity of a graph with maximum connectivity.Discrete Appl. Math.159(2011) 367\u2013380."},{"key":"R18","doi-asserted-by":"crossref","unstructured":"Piazza B., Roberts F. and Stueckle S., Edge-tenacious networks.Networks25(1995) 7\u201317.","DOI":"10.1002\/net.3230250103"},{"key":"R19","unstructured":"Wang S.Y., Yang YX., Lin S.W., Li J. and Hu Z.M., The isolated scattering number of graphs.Acta Math. Sinica, Chinese Series54(2011) 861\u2013874."},{"key":"R20","unstructured":"Wang S.Y., Wangmu J.S., Feng K., Lin S.W. and Zhang M.Y., Relation of the isolated scatting number of a graph and its complement graph.J. Shanxi University (Natural Science Edition)35(2012) 206\u2013210."},{"key":"R21","unstructured":"Wei Z. and Zhang S., Vertex-neighbour-integrity of composition graphs of paths and cycles.Int. J. Comput. Math.85(2008) 727\u2013733."},{"key":"R22","unstructured":"Wei Z.T., MAI A. and ZHAI M., Vertex-neighbor-scattering number of graphs.Ars Combin.102(2011) 417\u2013426."},{"key":"R23","unstructured":"Wu S.S.Y. and Cozzens M.B., The minimum size of critically m-neighbour-connected graphs.Ars Combin.29(1990) 149\u2013160."}],"container-title":["RAIRO - Theoretical Informatics and Applications"],"original-title":[],"link":[{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita\/2016001\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,6]],"date-time":"2019-09-06T17:08:07Z","timestamp":1567789687000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita\/2016001"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,10]]},"references-count":23,"journal-issue":{"issue":"4"},"alternative-id":["ita150052"],"URL":"https:\/\/doi.org\/10.1051\/ita\/2016001","relation":{},"ISSN":["0988-3754","1290-385X"],"issn-type":[{"value":"0988-3754","type":"print"},{"value":"1290-385X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,10]]}}}