563 20 16481 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 Faculty Publications 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/. Creator An entity primarily responsible for making the resource Khudania, Harshita; Rajesh, Richu; Raju, David Chris Title A name given to the resource On estimation of extropy for non-negative data with application on uniformity testing Date A point or period of time associated with an event in the lifecycle of the resource 01-01-2026 Source A related resource from which the described resource is derived Journal of Statistical Computation and Simulation;Volume;96;Issue;7;pp.1709-1727 Identifier An unambiguous reference to the resource within a given context <a href="https://doi.org/10.1080/00949655.2025.2605498" target="_blank" rel="noreferrer noopener">https://doi.org/10.1080/00949655.2025.2605498</a> <a href="https://www.scopus.com/pages/publications/105025469866?origin=resultslist" target="_blank" rel="noreferrer noopener">https://www.scopus.com/pages/publications/105025469866?origin=resultslist</a> Coverage The spatial or temporal topic of the resource, the spatial applicability of the resource, or the jurisdiction under which the resource is relevant Khudania H., Department of Statistics and Data Science, Christ (Deemed to be University), Karnataka, Bengaluru, India; Rajesh R., Department of Statistics, Government Victoria College, Kerala, Palakkad, India; Raju D.C., Department of Statistics, Nirmala College Muvattupuzha, Kerala, Ernakulam, India Description An account of the resource {Poisson weights-based density estimator is used to estimate the extropy function to the non-negative data}. The traditional class of nonparametric extropy estimators, typically constructed using kernel density estimators with symmetric kernels, is not well suited for non-negative data. To address this limitation, we propose two Poisson-weights-based density estimators that are naturally adapted to the non-negative domain. The asymptotic properties of the proposed estimators are rigorously established, providing theoretical support for their use. A comprehensive simulation study demonstrates that both estimators outperform their conventional kernel-based counterparts in terms of bias and mean squared error. Furthermore, we introduce uniformity tests based on extropy and obtain their critical values through simulation. The practical utility of the proposed methods is illustrated through analyses of real data sets. 2025 Informa UK Limited, trading as Taylor & Francis Group. Subject The topic of the resource Extropy; Kernel estimator; mean squared error; Poisson weights; uniform testing Publisher An entity responsible for making the resource available Taylor and Francis Ltd. Relation A related resource ISSN: 949655; Language A language of the resource English Type The nature or genre of the resource Article Rights Information about rights held in and over the resource Restricted Access; Hardcopy may be available in the library Format The file format, physical medium, or dimensions of the resource online 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 On families of graphs which are both adjacency equienergetic and distance equienergetic Subject The topic of the resource 05C50; 05C76; Distance energy; Distance equienergetic graphs; Equienergetic graphs; Graph energy Description An account of the resource Let A(G) and D(G) be the adjacency and distance matrices of a graph G respectively. The adjacency energy or A-energy EA(G) of a graph G is defined as the sum of the absolute values of the eigenvalues of A(G). Analogously, the D-energy ED(G) is defined to be the sum of the absolute values of the eigenvalues of D(G). One of the interesting problems on graph energy is to characterize those graphs which are equienergetic with respect to both the adjacency and distance matrices. A weaker problem is to construct the families of graphs which are equienergetic with respect to both the adjacency and distance matrices. In this paper, we find the explicit relations between A-energy and D-energy of certain families of graphs. As a consequence, we provide an answer to the above open problem (Indulal in https://icgc2020.wordpress.com/invitedlectures, 2020; http://www.facweb.iitkgp.ac.in/rkannan/gma.html, 2020) The Indian National Science Academy 2022. Creator An entity primarily responsible for making the resource Ramane H.S.; Parvathalu B.; Ashoka K.; Pirzada S. Source A related resource from which the described resource is derived Indian Journal of Pure and Applied Mathematics, Vol-55, No. 1, pp. 198-209. Publisher An entity responsible for making the resource available Indian National Science Academy Date A point or period of time associated with an event in the lifecycle of the resource 2024-01-01 Identifier An unambiguous reference to the resource within a given context <a href="https://doi.org/10.1007/s13226-022-00355-1" target="_blank" rel="noreferrer noopener">https://doi.org/10.1007/s13226-022-00355-1</a> <a href="https://www.scopus.com/inward/record.uri?eid=2-s2.0-85143701097&doi=10.1007%2Fs13226-022-00355-1&partnerID=40&md5=7c0a408480b326b1f4ad06c806c44217" target="_blank" rel="noreferrer noopener">https://www.scopus.com/inward/record.uri?eid=2-s2.0-85143701097&doi=10.1007%2fs13226-022-00355-1&partnerID=40&md5=7c0a408480b326b1f4ad06c806c44217</a> Rights Information about rights held in and over the resource Restricted Access Relation A related resource ISSN: 195588 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 Ramane H.S., Department of Mathematics, Karnatak University, Karnataka, Dharwad, 580003, India; Parvathalu B., Department of Mathematics, Christ University, Karnataka, Bangalore, 560029, India; Ashoka K., Department of Mathematics, Karnatak Universitys Karnatak Arts College, Karnataka, Dharwad, 580001, India; Pirzada S., Department of Mathematics, University of Kashmir, Kashmir, Srinagar, 190006, India 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 On ideal sumset labelled graphs Subject The topic of the resource Graph labelling; Ideal sumset labelling; Set-labelling; Sumset labelling Description An account of the resource The sumset of two sets A and B of integers, denoted by A + B, is defined as (formula presented). Let X be a non-empty set of non-negative integers. A sumset labelling of a graph G is an injective function (Formula Presented) such that the induced function (Formula Presented) is defined by (Formula presented). In this paper, we introduce the notion of ideal sumset labelling of graph and discuss the admissibility of this labelling by certain graph classes and discuss some structural characterization of those graphs. 2021 Jincy P. Mathai, Sudev Naduvath, and Satheesh Sreedharan. This is an open access article distributed under the terms of the Creative Commons License, which permits unrestricted use and distribution provided the original author and source are credited. Creator An entity primarily responsible for making the resource Mathai J.P.; Naduvath S.; Sreedharan S. Source A related resource from which the described resource is derived Proyecciones, Vol-40, No. 2 Publisher An entity responsible for making the resource available Universidad Catolica del Norte Date A point or period of time associated with an event in the lifecycle of the resource 2021-01-01 Identifier An unambiguous reference to the resource within a given context <a href="https://doi.org/10.22199/issn.0717-6279-2021-02-0022" target="_blank" rel="noreferrer noopener">https://doi.org/10.22199/issn.0717-6279-2021-02-0022</a> <a href="https://www.scopus.com/inward/record.uri?eid=2-s2.0-85102825307&doi=10.22199%2Fissn.0717-6279-2021-02-0022&partnerID=40&md5=7ab339a427c477b74e70eb017e7bf124" target="_blank" rel="noreferrer noopener">https://www.scopus.com/inward/record.uri?eid=2-s2.0-85102825307&doi=10.22199%2fissn.0717-6279-2021-02-0022&partnerID=40&md5=7ab339a427c477b74e70eb017e7bf124</a> Rights Information about rights held in and over the resource All Open Access; Gold Open Access Relation A related resource ISSN: 7160917 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 Mathai J.P., Muthoot Institute of Technology & Science, Dept of Mathematics, Puthencruz, KL, India; Naduvath S., CHRIST (Deemed to be University], Dept. of Mathematics, Bangalore, KA, India; Sreedharan S., Vidya Academy of Science & Technology, Dept. of Mathematics, Thrissur, KL, India 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 Conference Papers Conference Paper Faculty Publications- Conference Papers 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 On Improving Quality of Experience of 4G Mobile Networks A Slack Based Approach Subject The topic of the resource 4G mobile networks; Data Envelopment Analysis; Slack Based Measure Description An account of the resource This paper analyses Indias four top 4G Mobile network Providers with respect to five key user experience metrics Video, Games, Voice app, Download speed and Upload speed. Results using Data Envelopment Analysis show Airtel and Vodafone-Idea performing with maximum relative efficiency with respect to these metrics, while BSNL and Jio closely follow them. Further analysis using the Slack Based Measure shows where and by how much BSNL and Jio need to improve to perform at par with Airtel and Vodafone-Idea. On certain variables, for instance Voice app, BSNL and Jio perform well, with no need for improvement. On the contrary, for Upload and Download speed experiences, both BSNL and Jio lag. For Video and Games, there is still scope for improvement, although both these players are reasonable in their performance. Thus, this analysis provides an accurate and optimal benchmark for each variable whose user experience has been evaluated. 2021, Springer Nature Switzerland AG. Creator An entity primarily responsible for making the resource Gracia S; Soundarabai P.B.; Raj P. Source A related resource from which the described resource is derived Communications in Computer and Information Science, Vol-1483, pp. 129-141. Publisher An entity responsible for making the resource available Springer Science and Business Media Deutschland GmbH Date A point or period of time associated with an event in the lifecycle of the resource 2021-01-01 Identifier An unambiguous reference to the resource within a given context <a href="https://doi.org/10.1007/978-3-030-91244-4_11" target="_blank" rel="noreferrer noopener">https://doi.org/10.1007/978-3-030-91244-4_11</a> <a href="https://www.scopus.com/inward/record.uri?eid=2-s2.0-85122532137&doi=10.1007%2F978-3-030-91244-4_11&partnerID=40&md5=7619d45fa1106ff235efcd2d0e6744cc" target="_blank" rel="noreferrer noopener">https://www.scopus.com/inward/record.uri?eid=2-s2.0-85122532137&doi=10.1007%2f978-3-030-91244-4_11&partnerID=40&md5=7619d45fa1106ff235efcd2d0e6744cc</a> Rights Information about rights held in and over the resource Restricted Access Relation A related resource ISSN: 18650929; ISBN: 978-303091243-7 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 Conference paper Coverage The spatial or temporal topic of the resource, the spatial applicability of the resource, or the jurisdiction under which the resource is relevant Gracia S, Christ University (Deemed), Karnataka, Bangalore, India; Soundarabai P.B., Christ University (Deemed), Karnataka, Bangalore, India; Raj P., Reliance Jio Platforms Ltd., Karnataka, Bangalore, India 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 Conference Papers Conference Paper Faculty Publications- Conference Papers 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 On interval valued fuzzy graphs associated with a finite group Description An account of the resource We associate a particular type of interval-valued fuzzy graph(IVFG) called interval-valued fuzzy identity graph(IVFIG) with every finite group and study its various properties. We show that IVFIG associated with a finite group is not unique. We also show that every IVFIG associated with a finite group is a strong IVFG. It does not contain any feeble or weak arcs. Further, it is strongly connected. We prove that the IVFIG associated with a finite group in which every element is self inversed is an interval-valued fuzzy tree and the IVFIG of Zn (n is odd) under addition modulo n is the disjoint union of interval-valued fuzzy cycles. 2020 Author(s). Creator An entity primarily responsible for making the resource Philip A.M.; Kalayathankal S.J.; Kureethara J.V. Source A related resource from which the described resource is derived AIP Conference Proceedings, Vol-2236 Publisher An entity responsible for making the resource available American Institute of Physics Inc. Date A point or period of time associated with an event in the lifecycle of the resource 2020-01-01 Identifier An unambiguous reference to the resource within a given context <a href="https://doi.org/10.1063/5.0006810" target="_blank" rel="noreferrer noopener">https://doi.org/10.1063/5.0006810</a> <a href="https://www.scopus.com/inward/record.uri?eid=2-s2.0-85085696628&doi=10.1063%2F5.0006810&partnerID=40&md5=6af2b57de9279e67ac8040fd63aa7a15" target="_blank" rel="noreferrer noopener">https://www.scopus.com/inward/record.uri?eid=2-s2.0-85085696628&doi=10.1063%2f5.0006810&partnerID=40&md5=6af2b57de9279e67ac8040fd63aa7a15</a> Rights Information about rights held in and over the resource Restricted Access Relation A related resource ISSN: 0094243X; ISBN: 978-073541995-7 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 Conference paper Coverage The spatial or temporal topic of the resource, the spatial applicability of the resource, or the jurisdiction under which the resource is relevant Philip A.M., Assumption College, Changanacherry, Kerala, India; Kalayathankal S.J., Kuriakose Elias College, Mannanam, Kerala, India; Kureethara J.V., CHRIST (Deemed to Be University), Bangalore, Karnataka, India 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 On ion transport during the electrochemical reaction on plane and GLAD deposited WO3 thin films Subject The topic of the resource Coloration efficiency; Diffusion coefficient; GLAD; Plane; Sputtering; Tungsten Oxide (WO3) Description An account of the resource Tungsten oxide thin films were deposited on FTO and Corning glass substrates on Plane and GLAD (75) using DC magnetron sputtering and characterized using SEM, XRD, UVVis spectrophotometer, and Electrochemical analyzer systematically. Further, a comparative analysis was carried out in which it was observed that the result of surface morphology for plane showed the denser and GLAD showed nanopillars deposition. The amorphous nature of the sample was evident from XRD analysis. Optical transmittance was between 87% and 81% for both plane and GLAD. The Electrochemical studies showed the diffusion coefficient of H+ ions are more compared to Li+ ions for both plane and GLAD and Coloration efficiency was calculated at the scan rates of 10, 30, and 50 mV/s at the wavelength of 500 to 600 nm. 2021 Creator An entity primarily responsible for making the resource Naveen Kumar K.; Shaik H.; Chandrashekar L.N.; Aishwarya P.; Abdul Sattar S.; Nithya G.; Madhavi V.; Imran Jafri R.; Gupta J.; Ashok Reddy G.V. Source A related resource from which the described resource is derived Materials Today: Proceedings, Vol-59, pp. 275-282. Publisher An entity responsible for making the resource available Elsevier Ltd Date A point or period of time associated with an event in the lifecycle of the resource 2022-01-01 Identifier An unambiguous reference to the resource within a given context <a href="https://doi.org/10.1016/j.matpr.2021.11.113" target="_blank" rel="noreferrer noopener">https://doi.org/10.1016/j.matpr.2021.11.113</a> <a href="https://www.scopus.com/inward/record.uri?eid=2-s2.0-85131122384&doi=10.1016%2Fj.matpr.2021.11.113&partnerID=40&md5=df5cfb8391c2b98425151c3bbd19d9b2" target="_blank" rel="noreferrer noopener">https://www.scopus.com/inward/record.uri?eid=2-s2.0-85131122384&doi=10.1016%2fj.matpr.2021.11.113&partnerID=40&md5=df5cfb8391c2b98425151c3bbd19d9b2</a> Rights Information about rights held in and over the resource Restricted Access Relation A related resource ISSN: 22147853 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 Naveen Kumar K., Department of Physics, Nitte Meenakshi Institute of Technology, Yelahanka, Bengaluru, 560064, India, Centre for Nano-materials and MEMS, Nitte Meenakshi Institute of Technology, Yelahanka, Bengaluru, 560064, India; Shaik H., Department of Physics, Nitte Meenakshi Institute of Technology, Yelahanka, Bengaluru, 560064, India, Centre for Nano-materials and MEMS, Nitte Meenakshi Institute of Technology, Yelahanka, Bengaluru, 560064, India; Chandrashekar L.N., Department of Electronics and Communication, Nitte Meenakshi Institute of Technology, Yelahanka, Bengaluru, 560064, India, Centre for Nano-materials and MEMS, Nitte Meenakshi Institute of Technology, Yelahanka, Bengaluru, 560064, India; Aishwarya P., Department of Electronics and Communication, Nitte Meenakshi Institute of Technology, Yelahanka, Bengaluru, 560064, India, Centre for Nano-materials and MEMS, Nitte Meenakshi Institute of Technology, Yelahanka, Bengaluru, 560064, India; Abdul Sattar S., Department of Physics, Nitte Meenakshi Institute of Technology, Yelahanka, Bengaluru, 560064, India; Nithya G., Department of Electronics and Communication, Nitte Meenakshi Institute of Technology, Yelahanka, Bengaluru, 560064, India, Centre for Nano-materials and MEMS, Nitte Meenakshi Institute of Technology, Yelahanka, Bengaluru, 560064, India; Madhavi V., Interdisciplinary Centre for Energy Research, Indian Institute of Science, Bengaluru, 560012, India; Imran Jafri R., Department of Physics and Electronics, Christ University, Hosur Road, Bengaluru, 560029, India; Gupta J., Department of Physics, Nitte Meenakshi Institute of Technology, Yelahanka, Bengaluru, 560064, India, Centre for Nano-materials and MEMS, Nitte Meenakshi Institute of Technology, Yelahanka, Bengaluru, 560064, India; Ashok Reddy G.V., Department of Physics, Nitte Meenakshi Institute of Technology, Yelahanka, Bengaluru, 560064, India, Department of Physics, SJB Institute of Technology, Kengeri, Bengaluru, 560060, India 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 On J-Colouring of Chithra Graphs Subject The topic of the resource Chithra graph; Chromatic colouring of graphs; J-colouring of graphs; Rainbow neighbourhood in a graph Description An account of the resource The family of Chithra graphs is a wide ranging family of graphs which includes any graph of size at least one. Chithra graphs serve as a graph theoretical model for genetic engineering techniques or for modelling natural mutation within various biological networks found in living systems. In this paper, we discuss recently introduced J-colouring of the family of Chithra graphs. 2020, The National Academy of Sciences, India. Creator An entity primarily responsible for making the resource Naduvath S.; Kok J. Source A related resource from which the described resource is derived National Academy Science Letters, Vol-43, No. 6, pp. 543-545. Publisher An entity responsible for making the resource available Springer Date A point or period of time associated with an event in the lifecycle of the resource 2020-01-01 Identifier An unambiguous reference to the resource within a given context <a href="https://doi.org/10.1007/s40009-020-00906-2" target="_blank" rel="noreferrer noopener">https://doi.org/10.1007/s40009-020-00906-2</a> <a href="https://www.scopus.com/inward/record.uri?eid=2-s2.0-85079457228&doi=10.1007%2Fs40009-020-00906-2&partnerID=40&md5=a917b7d26663a93ab6021b76ed0c7766" target="_blank" rel="noreferrer noopener">https://www.scopus.com/inward/record.uri?eid=2-s2.0-85079457228&doi=10.1007%2fs40009-020-00906-2&partnerID=40&md5=a917b7d26663a93ab6021b76ed0c7766</a> Rights Information about rights held in and over the resource Restricted Access Relation A related resource ISSN: 0250541X 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 Naduvath S., Department of Mathematics, CHRIST (Deemed to be University), Bangalore, 560029, Karnataka, India; Kok J., Department of Mathematics, CHRIST (Deemed to be University), Bangalore, 560029, Karnataka, India 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 Faculty Publications Conference Paper Faculty Publications- Conference Papers 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/. Creator An entity primarily responsible for making the resource Flora, Jeba S.; Roy, Anirban; Saikia, Manjil P. Title A name given to the resource On k-Facile Perfect Numbers Date A point or period of time associated with an event in the lifecycle of the resource 01-01-2025 Source A related resource from which the described resource is derived Springer Proceedings in Mathematics and Statistics;Volume;474;pp.111-121 Identifier An unambiguous reference to the resource within a given context <a href="https://doi.org/10.1007/978-981-97-6798-4_9" target="_blank" rel="noreferrer noopener">https://doi.org/10.1007/978-981-97-6798-4_9</a> <a href="https://www.scopus.com/pages/publications/85218939286?origin=resultslist" target="_blank" rel="noreferrer noopener">https://www.scopus.com/pages/publications/85218939286?origin=resultslist</a> Coverage The spatial or temporal topic of the resource, the spatial applicability of the resource, or the jurisdiction under which the resource is relevant Flora J.S., Department of Mathematics, CHRIST (Deemed to be University), Bangalore, India; Roy A., Department of Sciences and Humanities, CHRIST (Deemed to be University), Bangalore, India; Saikia M.P., Mathematical and Physical Sciences Division, School of Arts and Sciences, Ahmedabad University, Gujarat, Navrangpura, Ahmedabad, 380009, India Description An account of the resource For a positive integer n, let ?(n) denote the sum of all positive divisors of n. Then n is said to be a k-facile perfect number if ?(n) = 2n + d1d2 dk, where 1 < d1, d2,, dk < n are distinct divisors of n. This paper characterizes k-facile perfect numbers and establishes their relationships with other special numbers. The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025. Subject The topic of the resource Facile-perfect number; Near-perfect number; Perfect number Publisher An entity responsible for making the resource available Springer Relation A related resource ISSN: 21941009; ISBN: 978-981976797-7; Language A language of the resource English Type The nature or genre of the resource Conference paper Rights Information about rights held in and over the resource Restricted Access; Hardcopy may be available in the library 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 On L? (2, 1)-Edge Coloring Number of Regular Grids Subject The topic of the resource critical graph; hexagonal and triangular grids; L? (2,1) edge coloring number; rectangular Description An account of the resource In this paper, we study multi-level distance edge labeling for infinite rectangular, hexagonal and triangular grids. We label the edges with non-negative integers. If the edges are adjacent, then their color difference is at least 2 and if they are separated by exactly a single edge, then their colors must be distinct. We find the edge coloring number of these grids to be 9, 7 and 16, respectively so that we could color the edges of a rectangular, hexagonal and triangular grid with at most 10, 8 and 17 colors, respectively using this coloring technique. Repeating the sequence pattern for different grids, we can color the edges of a grid of larger size. 2019 D. Deepthy et al. Creator An entity primarily responsible for making the resource Deepthy D.; Kureethara J.V. Source A related resource from which the described resource is derived Analele Stiintifice ale Universitatii Ovidius Constanta, Seria Matematica, Vol-27, No. 3, pp. 65-81. Publisher An entity responsible for making the resource available Sciendo Date A point or period of time associated with an event in the lifecycle of the resource 2019-01-01 Identifier An unambiguous reference to the resource within a given context <a href="https://doi.org/10.2478/auom-2019-0034" target="_blank" rel="noreferrer noopener">https://doi.org/10.2478/auom-2019-0034</a> <a href="https://www.scopus.com/inward/record.uri?eid=2-s2.0-85078161976&doi=10.2478%2Fauom-2019-0034&partnerID=40&md5=59b5f845ca4eb8713d5d6a146d3f6b32" target="_blank" rel="noreferrer noopener">https://www.scopus.com/inward/record.uri?eid=2-s2.0-85078161976&doi=10.2478%2fauom-2019-0034&partnerID=40&md5=59b5f845ca4eb8713d5d6a146d3f6b32</a> Rights Information about rights held in and over the resource All Open Access; Gold Open Access Relation A related resource ISSN: 12241784 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 Deepthy D., Bharathiar University, Coimbatore, India; Kureethara J.V., Department of Mathematics, CHRIST (Deemed to be University), Bangalore, India 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 Faculty Publications 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/. Creator An entity primarily responsible for making the resource Bankapur, Divya; Naduvath, Sudev Title A name given to the resource ON L(2, 1)-ORDER SUM SIGNED GRAPH OF A FINITE GROUP Date A point or period of time associated with an event in the lifecycle of the resource 01-01-2025 Source A related resource from which the described resource is derived Discussiones Mathematicae - General Algebra and Applications;Volume;45;Issue;2;pp.281-293 Identifier An unambiguous reference to the resource within a given context <a href="https://doi.org/10.7151/dmgaa.1480" target="_blank" rel="noreferrer noopener">https://doi.org/10.7151/dmgaa.1480</a> <a href="https://www.scopus.com/pages/publications/105031151730?origin=resultslist" target="_blank" rel="noreferrer noopener">https://www.scopus.com/pages/publications/105031151730?origin=resultslist</a> Coverage The spatial or temporal topic of the resource, the spatial applicability of the resource, or the jurisdiction under which the resource is relevant Bankapur D., Department of Mathematics, Christ University, Bangalore, India; Naduvath S., Department of Mathematics, Christ University, Bangalore, India Description An account of the resource In this paper, we have constructed a color-induced signed graph of an algebraic graph, called the L(2, 1)-order sum signed graph of a group. Based on the nature of the group, the L(2, 1)-span of the order sum graph is obtained and the structural aspects of thus obtained L(2, 1)-order sum signed graph such as planarity, chordality, etc. have been investigated. We have also defined an automorphism which turns out to be the only possible automorphism on the graph and have investigated the structural aspects of the graph such as edge transitivity and vertex transitivity. Further, a line-signed graph of L(2, 1)-order sum signed graph, which is a line graph with a signing protocol defined for the edges, has also been introduced. We have also explored the regularity of the line-signed graph. 2025 Sciendo. All rights reserved. Subject The topic of the resource L(2, 1)-coloring; L(2,1)-order sum signed graph; negative chordality; positive chordality; pseudo-planarity; signed graph homomorphism Publisher An entity responsible for making the resource available Sciendo Relation A related resource ISSN: 15099415; Language A language of the resource English Type The nature or genre of the resource Article Rights Information about rights held in and over the resource All Open Access; Gold Open Access; Green Open Access Format The file format, physical medium, or dimensions of the resource online 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 On l(T, 1)-colouring of certain classes of graphs Subject The topic of the resource Algorithms; Channel Assignment; Graph colouring; L(T,1)-span Description An account of the resource For a given set T of non-negative integers including zero and a positive integer k, the L(T, 1)-Colouring of a graph G = (V, E) is a function c: V(G) ? {0, 0, , k} such that |c(u) ? c(v)| ? T if the distance between u and v is 1 and |c(u) ? c(v)| ? 0 whenever u and v are at distance 2. The L(T,1)-span, ?T,1(G) is the smallest positive integer k such that G admits an L(T, 1)-Colouring. In this article we initiate a study of this concept of L(T, 1)-Colouring by determining the value of ?T,1(G) for some classes of graphs and present algorithms to obtain the L(T, 1)-Colouring of paths and stars. 2020 IJSTR. Creator An entity primarily responsible for making the resource Pandey P.; Joseph M. Source A related resource from which the described resource is derived International Journal of Scientific and Technology Research, Vol-9, No. 3, pp. 6724-6731. Publisher An entity responsible for making the resource available International Journal of Scientific and Technology Research Date A point or period of time associated with an event in the lifecycle of the resource 2020-01-01 Identifier An unambiguous reference to the resource within a given context <a href="" target="_blank" rel="noreferrer noopener"></a> <a href="https://www.scopus.com/inward/record.uri?eid=2-s2.0-85082877252&partnerID=40&md5=f5f85397df4dbd62143bb7799e910dfd" target="_blank" rel="noreferrer noopener">https://www.scopus.com/inward/record.uri?eid=2-s2.0-85082877252&partnerID=40&md5=f5f85397df4dbd62143bb7799e910dfd</a> Rights Information about rights held in and over the resource Restricted Access Relation A related resource ISSN: 22778616 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 Pandey P., Department of Mathematics, CHRIST (Deemed to be University, India; Joseph M., Department of Mathematics, CHRIST (Deemed to be University, India 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 On Leech labelings of graphs and some related concepts Subject The topic of the resource Leech graph; Leech index; Leech labeling; Path number Description An account of the resource Let G=(V,E) be a graph and let f:E?{1,2,3,} be an edge labeling of G. The path weight of a path P in G is the sum of the labels of the edges of P and is denoted by w(P). The path number of G, tp(G) is the total number of paths in a graph G. If the set of all path weights S in G with respect to the labeling f is {1,2,3,,tp(G)}, then f is called a Leech labeling of G. A graph which admits a Leech labeling is called a Leech graph. Leech index is a parameter which evaluates how close a graph is towards being Leech. In this paper, the path number of the wheel graph Wn is obtained. We also determine a bound for the Leech index of Wn and a subclass of unicyclic graphs. A python program that gives all possible Leech labelings of a cycle Cn for n?3, if it exists, is also provided. 2023 Elsevier B.V. Creator An entity primarily responsible for making the resource Lakshmanan S. A.; Eldho M.M. Source A related resource from which the described resource is derived Discrete Mathematics, Vol-347, No. 4 Publisher An entity responsible for making the resource available Elsevier B.V. Date A point or period of time associated with an event in the lifecycle of the resource 2024-01-01 Identifier An unambiguous reference to the resource within a given context <a href="https://doi.org/10.1016/j.disc.2023.113837" target="_blank" rel="noreferrer noopener">https://doi.org/10.1016/j.disc.2023.113837</a> <a href="https://www.scopus.com/inward/record.uri?eid=2-s2.0-85179830543&doi=10.1016%2Fj.disc.2023.113837&partnerID=40&md5=73a18f19b5a84f5332f2d4de5e61ed32" target="_blank" rel="noreferrer noopener">https://www.scopus.com/inward/record.uri?eid=2-s2.0-85179830543&doi=10.1016%2fj.disc.2023.113837&partnerID=40&md5=73a18f19b5a84f5332f2d4de5e61ed32</a> Rights Information about rights held in and over the resource Restricted Access Relation A related resource ISSN: 0012365X; CODEN: DSMHA 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 Lakshmanan S. A., Department of Mathematics, Cochin University of Science and Technology, Kerala, Cochin, 22, India; Eldho M.M., Department of Mathematics, CHRIST (Deemed to be University), Kerala, Bangalore, India 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 On m-quasi Einstein almost Kenmotsu manifolds Subject The topic of the resource almost Kenmotsu(?,?)'-manifolds; Einstein manifolds; Kenmotsu manifolds; m-quasi Einstein metric; Ricci solitons Description An account of the resource In this article, we consider m-quasi Einstein structures on two class of almost Kenmotsu manifolds. Firstly, we study a closed m-quasi Einstein metric on a Kenmotsu manifold. Next, we proved that if a Kenmotsu manifold M admits an m-quasi Einstein metric with conformal vector field V, then M is Einstein. Finally, we prove that a non-Kenmotsu almost Kenmotsu (?,?)' -manifold admitting a closed m-quasi Einstein metric is locally isometric to the Riemannian product Hn+1Rn, provided that ?-?(2n+m)/2m = 1. 2021 Universita degli Studi di Parma. All rights reserved. Creator An entity primarily responsible for making the resource Venkatesha V.; Kumara H.A.; Naik D.M. Source A related resource from which the described resource is derived Rivista di Matematica della Universita di Parma, Vol-12, No. 2, pp. 287-299. Publisher An entity responsible for making the resource available Universita degli Studi di Parma Date A point or period of time associated with an event in the lifecycle of the resource 2021-01-01 Identifier An unambiguous reference to the resource within a given context <a href="" target="_blank" rel="noreferrer noopener"></a> <a href="https://www.scopus.com/inward/record.uri?eid=2-s2.0-85160081088&partnerID=40&md5=96461d940a09a888a2c00c90a49a8629" target="_blank" rel="noreferrer noopener">https://www.scopus.com/inward/record.uri?eid=2-s2.0-85160081088&partnerID=40&md5=96461d940a09a888a2c00c90a49a8629</a> Rights Information about rights held in and over the resource Restricted Access Relation A related resource ISSN: 356298 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 Venkatesha V., Department of Mathematics, Kuvempu University, Karnataka, Shankaraghatta, 577-451, India; Kumara H.A., Department of Mathematics, Kuvempu University, Karnataka, Shankaraghatta, 577-451, India; Naik D.M., Department of Mathematics, CHRIST (Deemed to Be University) Bangalore, Karnataka, Bengaluru, 560029, India 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 Faculty Publications 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/. Creator An entity primarily responsible for making the resource Flora, Jeba S.; Roy, Anirban; Mahanta, Pankaj Jyoti; Saikia, Manjil P. Title A name given to the resource ON NEAR Fk-PERFECT AND DEFICIENT Fk-PERFECT NUMBERS Date A point or period of time associated with an event in the lifecycle of the resource 01-01-2025 Source A related resource from which the described resource is derived Integers;Volume;25;Issue;;Article No.;A86; Identifier An unambiguous reference to the resource within a given context <a href="https://doi.org/10.5281/zenodo.17144463" target="_blank" rel="noreferrer noopener">https://doi.org/10.5281/zenodo.17144463</a> <a href="https://www.scopus.com/pages/publications/105017153072?origin=resultslist" target="_blank" rel="noreferrer noopener">https://www.scopus.com/pages/publications/105017153072?origin=resultslist</a> Coverage The spatial or temporal topic of the resource, the spatial applicability of the resource, or the jurisdiction under which the resource is relevant Flora J.S., Department of Mathematics, CHRIST (Deemed to be University), Bangalore, India; Roy A., Department of Sciences and Humanities, CHRIST (Deemed to be University), Bangalore, India; Mahanta P.J., Department of Mathematical Sciences, Tezpur University, Assam, Napaam, India; Saikia M.P., Mathematical and Physical Sciences division, School of Arts and Sciences, Ahmedabad University, Navrangpura, Gujarat, Ahmedabad, India Description An account of the resource For a positive integer n, the arithmetic function ?2(n) denotes the sum of squares of all the divisors of n. A positive integer n is called an F-perfect number if ?2(n) ? n2 = 3n. A positive integer n is termed a near F-perfect number if ?2(n) ? n2 ? d2 = 3n, where d is a proper divisor of n. Similarly, n is considered a deficient F-perfect number if ?2(n) ? n2 + d2 = 3n, where d is a proper divisor of n. In this paper, we discuss several characterizations of these numbers, establish their relations with other significant numbers, and generalize the near-perfect and deficient-perfect numbers. 2025, Colgate University. All rights reserved. Publisher An entity responsible for making the resource available Colgate University Relation A related resource ISSN: 15531732; Language A language of the resource English Type The nature or genre of the resource Article Rights Information about rights held in and over the resource Restricted Access; Hardcopy may be available in the library Format The file format, physical medium, or dimensions of the resource online 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 Conference Papers Conference Paper Faculty Publications- Conference Papers 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 On near-perfect numbers with five prime factors Subject The topic of the resource divisor sum function; Near-perfect numbers; perfect numbers Description An account of the resource Let n be a positive integer and ?(n) the sum of all the positive divisors of n. We call n a near-perfect number with redundant divisor d if ?(n) = 2n + d. Let n be an odd near-perfect number of the form n = pa11 ? pa22 ? pa33 ? pa44 ? pa55 where pis are odd primes and ais (1 ? i ? 5) are positive integers. In this article, we prove that 3 | n and one of 5, 7, 11 | n. We also show that there exists no odd near-perfect number when n = 3a1 ? 7a2 ? pa33 ? pa44 ? pa55 with p3 ? {17, 19} and when n = 3a1 ? 11a2 ? pa33 ? pa44 ? pa55 Mathematical and Computational Sciences - Proceedings of the ICRTMPCS International Conference 2023.All rights reserved. Creator An entity primarily responsible for making the resource Jeba F.S.; Roy A.; Saikia M.P. Source A related resource from which the described resource is derived De Gruyter Proceedings in Mathematics, pp. 207-220. Publisher An entity responsible for making the resource available Walter de Gruyter GmbH Date A point or period of time associated with an event in the lifecycle of the resource 2024-01-01 Identifier An unambiguous reference to the resource within a given context <a href="https://doi.org/10.1515/9783111313634-016" target="_blank" rel="noreferrer noopener">https://doi.org/10.1515/9783111313634-016</a> <a href="https://www.scopus.com/inward/record.uri?eid=2-s2.0-85216221756&doi=10.1515%2F9783111313634-016&partnerID=40&md5=5bde6ba289c8e745b5ffb27aeb9d9b1b" target="_blank" rel="noreferrer noopener">https://www.scopus.com/inward/record.uri?eid=2-s2.0-85216221756&doi=10.1515%2f9783111313634-016&partnerID=40&md5=5bde6ba289c8e745b5ffb27aeb9d9b1b</a> Rights Information about rights held in and over the resource Restricted Access Relation A related resource ISSN: 29424801; ISBN: 978-311130437-3 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 Conference paper Coverage The spatial or temporal topic of the resource, the spatial applicability of the resource, or the jurisdiction under which the resource is relevant Jeba F.S., Department of Mathematics, CHRIST (Deemed to be University), Kanmanike, Kumbalgodu, Mysore Road, Karnataka, Bengaluru, 560074, India; Roy A., Department of Sciences and Humanities, CHRIST (Deemed to be University), Kanmanike, Kumbalgodu, Mysore Road, Karnataka, Bengaluru, 560074, India; Saikia M.P., Mathematical and Physical Sciences division, School of Arts and Sciences, Ahmedabad University, Commerce Six Roads, Navrangpura, Gujarat, Ahmedabad, 380009, India 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 Faculty Publications 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/. Creator An entity primarily responsible for making the resource Kottarathil, Jomon; Naduvath, Sudev Title A name given to the resource On path-induced signed graphs Date A point or period of time associated with an event in the lifecycle of the resource 01-01-2026 Source A related resource from which the described resource is derived Acta Universitatis Sapientiae, Mathematica;Volume;18;Issue;1;Article No.;5; Identifier An unambiguous reference to the resource within a given context <a href="https://doi.org/10.1007/s44426-026-00032-4" target="_blank" rel="noreferrer noopener">https://doi.org/10.1007/s44426-026-00032-4</a> <a href="https://www.scopus.com/pages/publications/105031517381?origin=resultslist" target="_blank" rel="noreferrer noopener">https://www.scopus.com/pages/publications/105031517381?origin=resultslist</a> Coverage The spatial or temporal topic of the resource, the spatial applicability of the resource, or the jurisdiction under which the resource is relevant Kottarathil J., Department of Mathematics, St. Josephs College (Autonomous), Devagiri, Kerala, Kozhikode, 673008, India; Naduvath S., Department of Mathematics, CHRIST (Deemed to be University), Karnataka, Bangalore, 560029, India Description An account of the resource The path decomposition of a graph G is the process of decomposing it into edge-disjoint paths. An induced signed graph is a signed graph formed from an ordinary unsigned graph by assigning signs to its edges according to some protocol. In this paper, we introduce the notion of a path-induced signed graph as an induced signed graph whose edges receive a sign according to whether its end vertices are the end vertices of a path in a path decomposition of G. We also discuss some characteristics of this type of signed graph. The Author(s), under exclusive license to Sapientia Hungarian University of Transylvania 2026. Subject The topic of the resource Balance; Clusterability; Induced signed graphs; Path-induced signed graphs; Signed graphs Publisher An entity responsible for making the resource available Springer International Publishing Relation A related resource ISSN: 18446094; Language A language of the resource English Type The nature or genre of the resource Article Rights Information about rights held in and over the resource All Open Access; Gold Open Access Format The file format, physical medium, or dimensions of the resource online 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 Faculty Publications 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/. Creator An entity primarily responsible for making the resource Deepika, H.R.; Mangam, T.A. Title A name given to the resource On Proper Diameter of Certain Classes of Graphs Date A point or period of time associated with an event in the lifecycle of the resource 01-01-2025 Source A related resource from which the described resource is derived Palestine Journal of Mathematics;Volume;14;Issue;2;pp.1-11 Identifier An unambiguous reference to the resource within a given context <a href="https://www.scopus.com/pages/publications/105007465964?origin=resultslist" target="_blank" rel="noreferrer noopener">https://www.scopus.com/pages/publications/105007465964?origin=resultslist</a> Coverage The spatial or temporal topic of the resource, the spatial applicability of the resource, or the jurisdiction under which the resource is relevant Deepika H.R., Department of Mathematics, CHRIST (Deemed to be University), India; Mangam T.A., Department of Mathematics, CHRIST (Deemed to be University), India Description An account of the resource An edge coloring of a graph is said to be proper edge coloring if no two adjacent edges receive the same color. A graph G is said to be properly connected if there exists a properly edge colored path between every pair of vertices. For a properly connected graph G with a k-edge coloring c, the proper diameter of a graph, pdiamk (G) is the maximum proper distance between any distinct pair of vertices in G. We investigate the proper diameter of various classes of graphs that are 2-colored and provide bounds on the values of pdiam2(G) for these graphs. Palestine Polytechnic University-PPU 2025. Subject The topic of the resource Proper connectivity; Proper diameter Publisher An entity responsible for making the resource available Palestine Polytechnic University Relation A related resource ISSN: 22195688; Language A language of the resource English Type The nature or genre of the resource Article Rights Information about rights held in and over the resource Restricted Access; Hardcopy may be available in the library Format The file format, physical medium, or dimensions of the resource online 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 ON SECOND HYPER-ZAGREB INDEX OF CORONA PRODUCTS RELATED TO R-GRAPHS Subject The topic of the resource corona product; graph operations; second Hyper-Zagreb Index; semi-total point graphs Description An account of the resource The cognitive and evidential features of the graph discipline are significantly influenced by the implementation of graph operations. Molecular descriptor acts as a fundamental network invariant relevant to a particular molecular structure in the framework of chemical graph theory. The semi-total point graph features the edges of subdivision graph as well as the edges of the original graph. In this paper, we explore combinatorial inequalities associated with the edges, vertices and its corresponding neighborhood notions along with the inclusion of other molecular descriptors in the computations for the determination of exact expressions of second hyper-Zagreb index for certain corona products involving the semi-total point graph. 2023 Academic Publications Creator An entity primarily responsible for making the resource Sarkar I.; Nanjappa M. Source A related resource from which the described resource is derived International Journal of Applied Mathematics, Vol-36, No. 3, pp. 1-22. Publisher An entity responsible for making the resource available Academic Publications Ltd. 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.12732/ijam.v36i3.1" target="_blank" rel="noreferrer noopener">https://doi.org/10.12732/ijam.v36i3.1</a> <a href="https://www.scopus.com/inward/record.uri?eid=2-s2.0-85171594567&doi=10.12732%2Fijam.v36i3.1&partnerID=40&md5=ff94d2bde7d102a2cd6c78a17139794f" target="_blank" rel="noreferrer noopener">https://www.scopus.com/inward/record.uri?eid=2-s2.0-85171594567&doi=10.12732%2fijam.v36i3.1&partnerID=40&md5=ff94d2bde7d102a2cd6c78a17139794f</a> Rights Information about rights held in and over the resource All Open Access; Gold Open Access Relation A related resource ISSN: 13111728 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 Sarkar I., Department of Mathematics CHRIST (Deemed to be University), Bengaluru, 560029, India; Nanjappa M., Department of Mathematics CHRIST (Deemed to be University), Bengaluru, 560029, India 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 Book Chapter Book Chapter Faculty Publications- Book Chapter 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 On some classes of equitable irregular graphs Subject The topic of the resource Datasets; Edge labeling; Equitable irregular graph; k-equitable irregular edge labeling Description An account of the resource Graph labeling techniques are used by data scientists to represent data points and their relationships with each other. The segregation/sorting of similar datasets/points are easily done using labeling of vertices or edges in a graph. An equitable irregular edge labeling is a function $$f: E(G) \rightarrow N$$ (not necessarily be injective) such that the vertex sums of any two adjacent vertices of $$G$$ differ by at most one, where vertex sum of a vertex is the sum of the labels under $$f$$ of the edges incident with that vertex. A graph admitting an equitable irregular edge labeling is called an equitable irregular graph (EIG). In this paper, more classes of equitable irregular graphs are presented. We further generalize the concept of equitable irregular edge labeling to $$k$$-equitable irregular edge labeling by demanding the difference of the vertex sum of adjacent vertices to be $$k \ge 1$$. The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd 2021. Creator An entity primarily responsible for making the resource Puthussery A.; Hamid I.S. Source A related resource from which the described resource is derived Lecture Notes in Networks and Systems, Vol-132, pp. 281-288. Publisher An entity responsible for making the resource available Springer Date A point or period of time associated with an event in the lifecycle of the resource 2021-01-01 Identifier An unambiguous reference to the resource within a given context <a href="https://doi.org/10.1007/978-981-15-5309-7_30" target="_blank" rel="noreferrer noopener">https://doi.org/10.1007/978-981-15-5309-7_30</a> <a href="https://www.scopus.com/inward/record.uri?eid=2-s2.0-85090372456&doi=10.1007%2F978-981-15-5309-7_30&partnerID=40&md5=19e8439f52aa1587b11019d4a26dadbb" target="_blank" rel="noreferrer noopener">https://www.scopus.com/inward/record.uri?eid=2-s2.0-85090372456&doi=10.1007%2f978-981-15-5309-7_30&partnerID=40&md5=19e8439f52aa1587b11019d4a26dadbb</a> Rights Information about rights held in and over the resource Restricted Access Relation A related resource ISSN: 23673370 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 Book chapter Coverage The spatial or temporal topic of the resource, the spatial applicability of the resource, or the jurisdiction under which the resource is relevant Puthussery A., CHRIST Deemed to be University, Bengaluru, India; Hamid I.S., The Madura College, Madurai, 11, India 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 Conference Papers Conference Paper Faculty Publications- Conference Papers 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 On Some Graphs Whose Domination Number Is thePerfect Italian Domination Number Subject The topic of the resource Domination number; Independent set; Join operator; perfect italian domination Description An account of the resource Perfect Italian Domination (PID) is a vertex labelling of a graph G by numbers from the set such that a vertex in G labelled 0 has a neighbourhood where the summation of the labels of the vertices in it is precisely 2. The summation of labels on the vertices of the graph which satisfy the PID labelling is known as its PID number, and is the minimum possible PID number of a graph G. We find some characterization of graphs for which . We also find a lower bound for |V(G)|, which satisfies the same. Further, we discuss the graphs that satisfies or . A realisation problem is used to prove that PID cannot be bounded by a scalar multiple of the Domination number. The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2024. Creator An entity primarily responsible for making the resource Poovathingal A.; Kureethara J.V. Source A related resource from which the described resource is derived Lecture Notes in Networks and Systems, Vol-869 LNNS, pp. 191-200. Publisher An entity responsible for making the resource available Springer Science and Business Media Deutschland GmbH Date A point or period of time associated with an event in the lifecycle of the resource 2024-01-01 Identifier An unambiguous reference to the resource within a given context <a href="https://doi.org/10.1007/978-981-99-9040-5_13" target="_blank" rel="noreferrer noopener">https://doi.org/10.1007/978-981-99-9040-5_13</a> <a href="https://www.scopus.com/inward/record.uri?eid=2-s2.0-85190359075&doi=10.1007%2F978-981-99-9040-5_13&partnerID=40&md5=f982d7f6b7c83bb2e9bcd23f9d800b8b" target="_blank" rel="noreferrer noopener">https://www.scopus.com/inward/record.uri?eid=2-s2.0-85190359075&doi=10.1007%2f978-981-99-9040-5_13&partnerID=40&md5=f982d7f6b7c83bb2e9bcd23f9d800b8b</a> Rights Information about rights held in and over the resource Restricted Access Relation A related resource ISSN: 23673370; ISBN: 978-981999039-9 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 Conference paper Coverage The spatial or temporal topic of the resource, the spatial applicability of the resource, or the jurisdiction under which the resource is relevant Poovathingal A., Department of Mathematics, Christ University, Bangalore, India; Kureethara J.V., Department of Mathematics, Christ University, Bangalore, India