Dublin Core The Dublin Core metadata element set is common to all Omeka records, including items, files, and collections. For more information see, http://dublincore.org/documents/dces/. Title A name given to the resource Articles Article Faculty Publications -Articles Dublin Core The Dublin Core metadata element set is common to all Omeka records, including items, files, and collections. For more information see, http://dublincore.org/documents/dces/. Title A name given to the resource Vertex neighborhood restricted edge achromatic sums of graphs Subject The topic of the resource vertex incident 2-edge coloring number; vertex incident 2-edge coloring sum; Vertex induced 2-edge coloring number; vertex induced 2-edge coloring sum Description An account of the resource The vertex induced 2-edge coloring number ?vi2?(G) of a graph G is the highest number of colors that can occur in an edge coloring of a graph G such that not more than two colors can be used to color the edges in the induced subgraph (N[v]) generated by the closed neighborhood N[v] of a vertex v in V (G). The vertex induced 2-edge coloring sum of a graph G denoted as vi2?(G), is the greatest sum among all the vertex induced 2-edge coloring of a graph G which concedes ?vi2?(G) colors. The vertex incident 2-edge coloring number of a graph G is the highest number of colors required to color the edges of a graph G such that not more than two colors can be ceded to the edges incident at the vertex v of G. The vertex incident 2-edge coloring sum of a graph G denoted as vi2?(G), is the maximum sum among all the vertex incident 2-edge coloring of graph G which receives maximum ?vin2?(G) colors. In this paper, we initiate a study on the vertex induced 2-edge coloring sum and vertex incident 2-edge coloring sum concepts and apply the same to some graph classes. Besides finding the exact values of these parameters, we also obtain some bounds and a few comparative results. 2023 World Scientific Publishing Company. Creator An entity primarily responsible for making the resource Joseph A.; Dominic C. Source A related resource from which the described resource is derived Discrete Mathematics, Algorithms and Applications, Vol-15, No. 8 Publisher An entity responsible for making the resource available World Scientific Date A point or period of time associated with an event in the lifecycle of the resource 2023-01-01 Identifier An unambiguous reference to the resource within a given context <a href="https://doi.org/10.1142/S1793830922501695" target="_blank" rel="noreferrer noopener">https://doi.org/10.1142/S1793830922501695</a> <br /><br /><a href="https://www.scopus.com/inward/record.uri?eid=2-s2.0-85143622867&amp;doi=10.1142%2FS1793830922501695&amp;partnerID=40&amp;md5=2de1c31fa08e79e32062a21c8d8a4440" target="_blank" rel="noreferrer noopener">https://www.scopus.com/inward/record.uri?eid=2-s2.0-85143622867&amp;doi=10.1142%2fS1793830922501695&amp;partnerID=40&amp;md5=2de1c31fa08e79e32062a21c8d8a4440</a> Rights Information about rights held in and over the resource Restricted Access Relation A related resource ISSN: 17938309 Format The file format, physical medium, or dimensions of the resource Online Language A language of the resource English Type The nature or genre of the resource Article Coverage The spatial or temporal topic of the resource, the spatial applicability of the resource, or the jurisdiction under which the resource is relevant Joseph A., Department of Mathematics, CHRIST (Deemed to Be University), Karnataka, Bangalore, 560029, India; Dominic C., Department of Mathematics, CHRIST (Deemed to Be University), Karnataka, Bangalore, 560029, India, Department of Mathematical Sciences, University of Essex, Colchester, Essex, CO4 3SQ, United Kingdom