166
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
Merin Robert, Riya; Jayan, Krishnapriya; Cherian, Tom; Varghese, Anitha
Title
A name given to the resource
High Performance Ferrocene Immobilized Electrodes for the Synthesis of 3-Acetyl Coumarin: A Sustainable Approach
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
Journal of the Electrochemical Society;Volume;172;Issue;9;Article No.;96506;
Identifier
An unambiguous reference to the resource within a given context
<a href="https://doi.org/10.1149/1945-7111/ae096a" target="_blank" rel="noreferrer noopener">https://doi.org/10.1149/1945-7111/ae096a</a> <br /><br /><a href="https://www.scopus.com/pages/publications/105017729367?origin=resultslist" target="_blank" rel="noreferrer noopener">https://www.scopus.com/pages/publications/105017729367?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
Merin Robert R., Department of Chemistry, CHRIST (Deemed to be University), Bangalore, 560029, India; Jayan K., Department of Chemistry, CHRIST (Deemed to be University), Bangalore, 560029, India; Cherian T., Department of Chemistry, Christ (Autonomous), Kerala, Irinjalakkuda, 680125, India; Varghese A., Department of Chemistry, CHRIST (Deemed to be University), Bangalore, 560029, India
Description
An account of the resource
An electrocatalyst was developed for the synthesis of 3-acetyl coumarin, a known anticoagulant, anti-inflammatory, and anti-microbial compound, by constructing and employing an electrocatalyst with immobilized ferrocenyl aniline onto electro-polymerized anthranilic acid, on a carbon fiber paper electrode. The effectiveness of the modified carbon fiber paper electrode was assessed by analyzing its physicochemical and electrochemical properties, using optical profilometry, field-emission scanning electron spectroscopy (FE-SEM), Fourier-transform infrared spectroscopy (FT-IR), X-ray photoelectron spectroscopy (XPS), cyclic voltametric techniques and electrochemical impedance spectroscopy (EIS) respectively. 3-acetyl coumarin was synthesized using salicylaldehyde and ethyl acetoacetate as starting materials in the presence of piperidine, with lithium perchlorate as supporting electrolyte and ethanol as solvent, at potentiostatic conditions. The reaction was carried out in a three-electrode, single compartment system, at ambient conditions for three hours by using a constant potential of ?1.4 V. The product was purified by column chromatography and characterized by using gas chromatography-mass spectrometry (GC-MS) and proton nuclear magnetic resonance spectroscopy (1H-NMR). The developed electrode was found to be highly efficient towards the synthesis of 3-acetyl coumarin with a good yield of 78%, thereby proving the efficiency and selectivity of the process. 2025 The Electrochemical Society (ECS). Published on behalf of ECS by IOP Publishing Limited. All rights, including for text and data mining, AI training, and similar technologies, are reserved.
Subject
The topic of the resource
3-acetyl coumarin; conducting polymer; electro-polymerization; electrochemical synthesis; ferrocenyl aniline
Publisher
An entity responsible for making the resource available
Institute of Physics
Relation
A related resource
ISSN: 134651; CODEN: JESOA
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
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
Ann Maria, C.G.; Varghese, Anitha; Nidhin, M.
Title
A name given to the resource
Molecularly Imprinted Electrochemical Detection of Atrazine in Water Samples Using Chitosan-Stabilized Palladium Nanoparticles
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
Journal of the Electrochemical Society;Volume;172;Issue;2;Article No.;27510;
Identifier
An unambiguous reference to the resource within a given context
<a href="https://doi.org/10.1149/1945-7111/adb458" target="_blank" rel="noreferrer noopener">https://doi.org/10.1149/1945-7111/adb458</a> <br /><br /><a href="https://www.scopus.com/pages/publications/85218923928?origin=resultslist" target="_blank" rel="noreferrer noopener">https://www.scopus.com/pages/publications/85218923928?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
Ann Maria C.G., Department of Chemistry, CHRIST (Deemed to be University, Bengaluru, 560029, India; Varghese A., Department of Chemistry, CHRIST (Deemed to be University, Bengaluru, 560029, India; Nidhin M., Department of Chemistry, CHRIST (Deemed to be University, Bengaluru, 560029, India
Description
An account of the resource
Atrazine, a slow-degrading herbicide needs constant monitoring and control as it causes carcinogenicity and reproductive abnormalities. This study presents a new electrochemical sensor designed to detect atrazine in water with high precision. The sensor uses a special technique called molecular imprinting along with chitosan-stabilized palladium nanoparticles on a glassy carbon electrode. The PdNPs enhance the electroactive surface area and thus the number of interaction sites for the analyte. Different material characterization techniques were used to characterize the formulated PdNPs. Molecularly imprinted nanomaterials were used to provide the selectivity among other interferents of atrazine. Differential pulse Voltammetry was used to detect atrazine with a limit of detection of 10.115 fM and a wide linear dynamic range of 33.72 fM to 3.1 nM. The sensor was efficiently tested in different polluted water samples without interference from structural analogs. This sensor offers a reliable tool for monitoring water quality and protecting human health by ensuring atrazine levels are safely controlled. 2025 The Electrochemical Society (ECS). Published on behalf of ECS by IOP Publishing Limited. All rights, including for text and data mining, AI training, and similar technologies, are reserved.
Subject
The topic of the resource
atrazine; chitosan; electrochemical sensors; molecular imprinting technology; palladium nanoparticles
Publisher
An entity responsible for making the resource available
Institute of Physics
Relation
A related resource
ISSN: 134651; CODEN: JESOA
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
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
Vetriveeran, Divya; Sri, Leena R.
Title
A name given to the resource
Resource Provisioning in Fog Computing - A Survey
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
ACM Computing Surveys;Volume;57;Issue;12;Article No.;305;
Identifier
An unambiguous reference to the resource within a given context
<a href="https://doi.org/10.1145/3744662" target="_blank" rel="noreferrer noopener">https://doi.org/10.1145/3744662</a> <br /><br /><a href="https://www.scopus.com/pages/publications/105011388077?origin=resultslist" target="_blank" rel="noreferrer noopener">https://www.scopus.com/pages/publications/105011388077?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
Vetriveeran D., AIML & Data Science, Christ University, Bangalore, India; Sri L.R., Computer Science and Engineering, Thiagarajar College of Engineering, Madurai, India
Description
An account of the resource
The internet world has created an era where any device can interconnect with each other. Gathering intelligence from streaming data is challenging and can create wonders and valuable innovations for humanity. The shortcomings of connectivity due to the remote location of the cloud induce latency and performance issues in real-time. Thus, a traditional cloud may not be suitable for all applications. A secure, low latent bandwidth infrastructure under research led to Fog Computing. The fog nodes have limited resources, and effective utilization can boost the applications performance. Ensuring effective routing of the tasks and load balancing among the nodes is essential and tedious in any network. Resource management becomes challenging due to heterogeneity, dynamic workload, unpredictability of the computing environment, and so on. In such cases, using Artificial Intelligence (AI) can be promising, provided the complexity and the computing are handled. Proactive load handling based on the changes in network traffic has a huge scope for research. This article gives a detailed survey of the various fog network architectures and the intelligent methodologies in resource allocation in a fog network using machine learning algorithms. Furthermore, the article shows the directions of research in intelligent resource allocation and handling. 2025 Copyright held by the owner/author(s)
Subject
The topic of the resource
artificial intelligence algorithms; Fog computing; mi-croservices; research challenges; resource provisioning; software defined networking
Publisher
An entity responsible for making the resource available
Association for Computing Machinery
Relation
A related resource
ISSN: 3600300; CODEN: ACSUE
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; Hybrid 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
Pathak, Agnibh; Bhattacharjee, Soham; Saha, Tulika; Saha, Sriparna
Title
A name given to the resource
Does Sentiment and Emotion Affect Mental Health? A Multi-task Classification Framework for Comprehensive Understanding of Mental Health, Emotion, and Sentiment from Motivational Conversations
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
ACM Transactions on Computing for Healthcare;Volume;6;Issue;2;Article No.;ART28;
Identifier
An unambiguous reference to the resource within a given context
<a href="https://doi.org/10.1145/3704740" target="_blank" rel="noreferrer noopener">https://doi.org/10.1145/3704740</a> <br /><br /><a href="https://www.scopus.com/pages/publications/105004260490?origin=resultslist" target="_blank" rel="noreferrer noopener">https://www.scopus.com/pages/publications/105004260490?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
Pathak A., Christ University, Bangalore, India; Bhattacharjee S., Christ University, Bangalore, India; Saha T., International Institute of Information Technology, Bangalore, Bangalore, India; Saha S., Indian Institute of Technology, Patna, Patna, India
Description
An account of the resource
In light of the escalating challenges posed by our modern lifestyle, cultivating a nuanced approach for addressing mental health issues becomes imperative. Navigating the complexities of daily life demands a thoughtful and comprehensive strategy to identify and address the diverse array of mental health issues that may manifest. The challenges in accurately identifying mental health expressions stem from their complex character of communication, which frequently shares linguistic patterns and similar expressive nuances as communicated by humans. However, we hypothesize that mental health conditions are closely associated with affective factors in particular feelings, moods, and emotions. These states define how we think, feel, and behave. Thus, in this article, we aim to explore and analyze the association of the affective states such as sentiment and emotion with mental health in the view of identifying mental health conditions accurately once the feelings and emotions of humans are understood. In this regard, this article investigates multi-task classification encompassing mental health disorder identification (MHDI), emotion recognition (ER), and sentiment analysis (SA) in non-clinical conversations where MHDI forms the primary task and ER-SA the auxiliary tasks boosting the identification of the primary one. To demonstrate our hypothesis, we propose Core Fusion Network (CFN), a variation of multi-tasking in light of the significance that sentiment and emotion plays in understanding mental health. This method adeptly considers private and shared features across tasks, significantly enhancing classification precision. For our study, we extend the recently released MotiVAte dataset containing dyadic conversations between support seekers and a virtual assistant imparting hope and motivation to enclose emotion and sentiment tags for each conversation in a semi-supervised manner. Our hypothesis is reinforced by an extensive ablation study with state-of-the-art multi-task models and the proposed Core Fusion Network (CFN), which exhibits increased accuracy of 89.12% for MHDI, 64.24% for ER, and 79.04% for SA in the tri-task variant as opposed to its corresponding uni-task and bi-task variants. These outcomes underscore the potential of multi-task learning in streamlining mental health classification by integrating emotional and sentiment dimensions. 2025 Copyright held by the owner/author(s) Publication rights licensed to ACM.
Subject
The topic of the resource
Classification; Dialogue; Emotion; Mental Health Disorder; Multi-task Learning; Sentiment
Publisher
An entity responsible for making the resource available
Association for Computing Machinery
Relation
A related resource
ISSN: 26911957;
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; Bronze 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
John, Athira Maria; Xavier, Sebin Sebastian; Benny, Cyril; Philip, Reji; Balakrishnan, Sreeja Puthanveetil
Title
A name given to the resource
Photoisomerization Dynamics of 2-[(E)-(4-fluorophenyl)diazenyl]- 1H-imidazole: A Theoretical and Experimental Insight
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
Journal of Computational Biophysics and Chemistry;Volume;24;Issue;4;pp.521-533
Identifier
An unambiguous reference to the resource within a given context
<a href="https://doi.org/10.1142/S2737416524500698" target="_blank" rel="noreferrer noopener">https://doi.org/10.1142/S2737416524500698</a> <br /><br /><a href="https://www.scopus.com/pages/publications/105002381374?origin=resultslist" target="_blank" rel="noreferrer noopener">https://www.scopus.com/pages/publications/105002381374?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
John A.M., Department of Chemistry, School of Sciences, Christ University, Central Campus, Karnataka, Bengaluru, 560029, India; Xavier S.S., Light and Matter Physics Group, Raman Research Institute, C.V. Raman Avenue, Karnataka, Bangalore, 560080, India; Benny C., Light and Matter Physics Group, Raman Research Institute, C.V. Raman Avenue, Karnataka, Bangalore, 560080, India; Philip R., Light and Matter Physics Group, Raman Research Institute, C.V. Raman Avenue, Karnataka, Bangalore, 560080, India; Balakrishnan S.P., Department of Chemistry, School of Sciences, Christ University, Central Campus, Karnataka, Bengaluru, 560029, India
Description
An account of the resource
This study investigates the photoresponsive behavior of substituted azobenzenes with a specific focus on their nonlinear optical response. This study suggests that azoimidazole substitution is a better alternative to azobenzene derivatives for nonlinear optical responses. The synthesis, characterization, photophysical property and isomerization pathway of 2-[(E)-(4-fluorophenyl)diazenyl]-1H-imidazole (E-2g) are presented as an optical limiter through a comprehensive blend of experimental and theoretical approaches. Notably, E-2g exhibited a lower energy barrier than reported azobenzenes. The trans-to-cis photostationary state was reached in 75 min, while the cis-to-trans state was achieved in 60 min at 354 nm. The study further explores the photoisomerization pathway of E-2g, highlighting its nonlinear absorption, which has a nonlinear absorption coefficient (?eff) of 8.8 10?11 m/W at 20 ?J, as determined by Z-scan measurements. The results suggest that E-2g exhibits significant nonlinear absorption characteristics, which helps in applications requiring protection from intense light sources. This study explores the photoresponsive behavior of substituted azobenzenes derivative, azoimidazole, over unsubstituted azobenzene derivatives for nonlinear optical properties. Through experimental and theoretical analyses, the title compound was synthesized, characterized, and shown to have a lower energy barrier and efficient photoisomerization in solution. Its strong nonlinear absorption properties make it a promising candidate for optical limiting applications, such as eye protection and safeguarding sensitive optical sensors. 2025 World Scientific Publishing Company.
Subject
The topic of the resource
Azoimidazole; nonlinear optics; optical limiters; photoisomerization; TD-DFT
Publisher
An entity responsible for making the resource available
World Scientific
Relation
A related resource
ISSN: 27374165;
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
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
Channakote, Mahadev M.; B, O. Anwar; Kuharat, S.; Shekar, M.; Siddabasappa, C.
Title
A name given to the resource
Electro-osmotically modulated viscoelastic SWCNT-blood flow in symmetric/nonsymmetric stenosed arteries with heat generation using a fractional second grade model
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
International Journal of Computational Materials Science and Engineering;Issue;;Article No.;2550026;
Identifier
An unambiguous reference to the resource within a given context
<a href="https://doi.org/10.1142/S2047684125500265" target="_blank" rel="noreferrer noopener">https://doi.org/10.1142/S2047684125500265</a> <br /><br /><a href="https://www.scopus.com/pages/publications/105013045765?origin=resultslist" target="_blank" rel="noreferrer noopener">https://www.scopus.com/pages/publications/105013045765?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
Channakote M.M., Department of Mathematics and Statistics, M. S. Ramaiah University of Applied Sciences, Karnataka, Bengaluru, 560054, India; B O.A., Multi-Physical Engineering Sciences Group, Mechanical Engineering Department, University of Salford, Corrosion/Coating Lab. 3-08, SEE Building, Manchester, M54WT, United Kingdom; Kuharat S., Multi-Physical Engineering Sciences Group, Mechanical Engineering Department, University of Salford, Corrosion/Coating Lab. 3-08, SEE Building, Manchester, M54WT, United Kingdom; Shekar M., Department of Mathematics, B. M. S. College of Engineering, Bengaluru, India; Siddabasappa C., Department of Sciences and Humanities, CHRIST (Deemed to be University), Bengaluru, India
Description
An account of the resource
This study examines the electro-osmotically modulated viscoelastic blood flow in arteries with both symmetric and nonsymmetric stenosis, accounting for heat generation and thermal buoyancy effects. Blood is modeled as a fractional second-grade fluid to more accurately capture its viscoelastic and memory-dependent behavior. The DebyeHkel linearization is applied to analyze the electro-osmotic effects. The governing partial differential equations are reduced to a system of ordinary differential equations using appropriate scaling transformations. Analytical solutions are derived for the resulting nondimensional boundary value problem. Key flow characteristics, such as axial velocity, temperature distribution, electric potential, volumetric flow rate, and wall shear stress, are computed and illustrated graphically using the Mathematica software. The computations reveal that axial velocity decreases near the arterial walls but increases in the core region for both symmetric (n = 2) and nonsymmetric (n = 6) stenoses with rising HelmholtzSmoluchowski velocity (UHs), CNT volume fraction (?), Debye length parameter (m), and stenosis height (e). Heat generation (? > 0) further enhances both velocity and temperature. Increasing ? reduces temperature and wall shear stress (?w), while higher flow rate (Q) and stenosis height (e) are elevated (?w). Nonsymmetric stenoses yield higher temperatures than symmetric ones. Trapping boluses grow in size and number with increasing Q for both stenosis types. These findings underscore the significant role of electro-osmotic and viscoelastic effects in hemodynamic regulation, with potential biomedical applications. World Scientific Publishing Europe Ltd.
Subject
The topic of the resource
electro-osmosis; fractional second grade fluid; heat transfer; Hemodynamic; Mathematica software; single wall carbon nanotubes (CNTs); stenosis; wall shear stress
Publisher
An entity responsible for making the resource available
World Scientific
Relation
A related resource
ISSN: 20476841;
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
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
Channakote, Mahadev M.; Siddabasappa, C.; Tripathi, D.
Title
A name given to the resource
Peristaltic mechanism of Ellis fluid with viscous dissipation and thermal radiation induced by cilia wave
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
International Journal of Computational Materials Science and Engineering;Volume;14;Issue;4;Article No.;2450006;
Identifier
An unambiguous reference to the resource within a given context
<a href="https://doi.org/10.1142/S2047684124500064" target="_blank" rel="noreferrer noopener">https://doi.org/10.1142/S2047684124500064</a> <br /><br /><a href="https://www.scopus.com/pages/publications/85190114317?origin=resultslist" target="_blank" rel="noreferrer noopener">https://www.scopus.com/pages/publications/85190114317?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
Channakote M.M., Department of Mathematics and Statistics, M. S. Ramaiah University of Applied Sciences, Bangalore, India; Siddabasappa C., Department of Sciences and Humanities CHRIST, Deemed to be University, Bangalore, India; Tripathi D., Department of Mathematics, National Institute of Technology Uttarakhand, Srinagar, Uttarakhand, Garhwal, 246174, India
Description
An account of the resource
Bioheat transfer analysis in tissue has attracted the attention of numerous researchers due to its widespread potential applications in the medical field, mainly in thermotherapy and the human thermoregulation system. Also, temperature regulation of the human body primarily occurs through bioheat transfer. Due to the widespread biomedical applications of bio-heat transfer, we aim to investigate the movement of biofluid and bioheat in human organs with the influences of thermal radiation and ciliary waves. The mathematical model for Ellis fluid flow through a tube includes the metachronal wave of cilia motion and convective conditions. The governing equations are created based on mass, momentum conservation, and energy. The current problem is displayed and exact solutions are managed under long wavelength (? ? 1) and low Reynolds number (Re ? 1) approximations. An analytical approach is employed to derive expressions for longitudinal velocity, temperature, pressure gradient, and stream function as a function of the parameters of the problem. The physical behavior of the peristaltic motion of the Ellis fluid is explained in detail and illustrated graphically for various parameter values. The results of the current study provide potential information for advancement in the biomedical industry, particularly in the development of biomedical devices and processes. 2025 World Scientific Publishing Europe Ltd.
Subject
The topic of the resource
cilia wave; Ellis fluid; heat transfer; peristaltic flow; thermal radiation
Publisher
An entity responsible for making the resource available
World Scientific
Relation
A related resource
ISSN: 20476841;
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
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
Sajitha, I.; Sambandam, Rakoth Kandan; John, Saju P.
Title
A name given to the resource
Improvized machine learning model for extracting building footprints from collapsed images using high-resolution remote sensing images
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
International Journal of Modeling, Simulation, and Scientific Computing;Issue;;Article No.;2541019;
Identifier
An unambiguous reference to the resource within a given context
<a href="https://doi.org/10.1142/S1793962325410193" target="_blank" rel="noreferrer noopener">https://doi.org/10.1142/S1793962325410193</a> <br /><br /><a href="https://www.scopus.com/pages/publications/105009641185?origin=resultslist" target="_blank" rel="noreferrer noopener">https://www.scopus.com/pages/publications/105009641185?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
Sajitha I., Department of Computer Science and Engineering, CHRIST University, Karnataka, Bangalore, India; Sambandam R.K., Department of Computer Science and Engineering, CHRIST University, Karnataka, Bangalore, India; John S.P., Department of Computer Science and Engineering, Jyothi Engineering College, Cheruthuruthy, Kerala, Thrissur, India
Description
An account of the resource
We propose the development of a robust Enhanced U-Net framework for detecting building objects in images compromised by collapse. Traditional approaches often struggle to identify smaller buildings obstructed by taller structures, trees, or cloud coverage. However, recent advancements in machine learning algorithms present promising opportunities to address these challenges and improve the accuracy of building object detection and damage assessment. The proposed method employs the Siamese U-Net framework, enhanced with novel machine learning algorithms to overcome limitations in existing methodologies and increase the accuracy and reliability of damage assessment, even in complex scenarios. By using augmented satellite images during testing and lowering the building threshold value, our model can accurately predict damaged buildings and retrieve the footprints of smaller structures. The results of this research will advance image analysis techniques, especially in scenarios where collapsed structures pose significant identification and damage assessment challenges. This will be invaluable for government disaster management agencies, insurance companies, and other related organizations. 2025 World Scientific Publishing Company.
Subject
The topic of the resource
augmentation; building footprints; convolutional neural networks; disaster management; image processing; machine learning; Remote sensing; satellite images
Publisher
An entity responsible for making the resource available
World Scientific
Relation
A related resource
ISSN: 17939623;
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
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
Prebhath, Vinny Susan; Naduvath, Sudev
Title
A name given to the resource
The s-shunt non-intersection graph of a graph
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
Discrete Mathematics, Algorithms and Applications;Issue;;Article No.;2650029;
Identifier
An unambiguous reference to the resource within a given context
<a href="https://doi.org/10.1142/S1793830926500291" target="_blank" rel="noreferrer noopener">https://doi.org/10.1142/S1793830926500291</a> <br /><br /><a href="https://www.scopus.com/pages/publications/105033394833?origin=resultslist" target="_blank" rel="noreferrer noopener">https://www.scopus.com/pages/publications/105033394833?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
Prebhath V.S., Department of Mathematics, Christ University, Christ University, Bangalore, India; Naduvath S., Department of Mathematics, Christ University, Christ University, Bangalore, India
Description
An account of the resource
For an integer s ? 1, an s ? arc in a graph G is a sequence of (s + 1) vertices (v1,v2,,vs,vs+1) of G such that for all 1 ? i ? s, vi ? vi+1, and for all 1 ? i ? s ? 1, vi?vi+2. A non-intersection graph of the set of all s-arcs on distinct vertices of G, that can be shunted onto some other s-arc on distinct vertices of G, has been introduced. Basic properties based on the order, size and the degree of an arbitrary vertex of the non-intersection graph of a graph defined are obtained. Additionally, certain properties pertaining to the connectedness of the same are discussed. 2026 World Scientific Publishing Company.
Subject
The topic of the resource
Intersection graphs; s-arcs; s-shunt non-intersection graph
Publisher
An entity responsible for making the resource available
World Scientific
Relation
A related resource
ISSN: 17938309;
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
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
Cherian, Merin; Mangam, Tabitha Agnes
Title
A name given to the resource
Introduction to connecting coalitions
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
Discrete Mathematics, Algorithms and Applications;Issue;;Article No.;2550158;
Identifier
An unambiguous reference to the resource within a given context
<a href="https://doi.org/10.1142/S1793830925501587" target="_blank" rel="noreferrer noopener">https://doi.org/10.1142/S1793830925501587</a> <br /><br /><a href="https://www.scopus.com/pages/publications/105022625275?origin=resultslist" target="_blank" rel="noreferrer noopener">https://www.scopus.com/pages/publications/105022625275?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
Cherian M., Department of Mathematics, Christ (Deemed to be University), Karnataka, Bengaluru, India; Mangam T.A., Department of Mathematics, Christ (Deemed to be University), Karnataka, Bengaluru, India
Description
An account of the resource
A connecting coalition in a graph G(V;E) consists of two disjoint vertex subsets V1 and V2 of V (G), where neither G[V1] nor G[V2] is a connected graph but G[V1 [V2] is a con- nected graph. A connecting coalition partition is a vertex partition ? = fV1; V2; : : : ; Vkg, and the maximum cardinality of all possible ? is called the connecting coalition number, ?(G). Some bounds on the coalition number ?(G) are found, and graphs having ?(G) = 2 are characterized. Further, the existence of connecting coalition partitions in graphs is explored. 2025 World Scientific Publishing Company.
Subject
The topic of the resource
coalition partition; Connected graphs; induced subgraphs
Publisher
An entity responsible for making the resource available
World Scientific
Relation
A related resource
ISSN: 17938309;
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
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
Cherian, Merin; Mangam, Tabitha Agnes
Title
A name given to the resource
Introduction to connecting coalitions
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
Discrete Mathematics, Algorithms and Applications;Issue;;Article No.;2550158;
Identifier
An unambiguous reference to the resource within a given context
<a href="https://doi.org/10.1142/S1793830925501587" target="_blank" rel="noreferrer noopener">https://doi.org/10.1142/S1793830925501587</a> <br /><br /><a href="https://www.scopus.com/pages/publications/105022625275?origin=resultslist" target="_blank" rel="noreferrer noopener">https://www.scopus.com/pages/publications/105022625275?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
Cherian M., Department of Mathematics, Christ (Deemed to be University), Karnataka, Bengaluru, India; Mangam T.A., Department of Mathematics, Christ (Deemed to be University), Karnataka, Bengaluru, India
Description
An account of the resource
A connecting coalition in a graph G(V;E) consists of two disjoint vertex subsets V1 and V2 of V (G), where neither G[V1] nor G[V2] is a connected graph but G[V1 [V2] is a con- nected graph. A connecting coalition partition is a vertex partition ? = fV1; V2; : : : ; Vkg, and the maximum cardinality of all possible ? is called the connecting coalition number, ?(G). Some bounds on the coalition number ?(G) are found, and graphs having ?(G) = 2 are characterized. Further, the existence of connecting coalition partitions in graphs is explored. 2025 World Scientific Publishing Company.
Subject
The topic of the resource
coalition partition; Connected graphs; induced subgraphs
Publisher
An entity responsible for making the resource available
World Scientific
Relation
A related resource
ISSN: 17938309;
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
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
Alex, Annie; Sangeetha, V.
Title
A name given to the resource
Secure equitable domination in Cartesian product 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
Discrete Mathematics, Algorithms and Applications;Issue;;Article No.;2550128;
Identifier
An unambiguous reference to the resource within a given context
<a href="https://doi.org/10.1142/S1793830925501289" target="_blank" rel="noreferrer noopener">https://doi.org/10.1142/S1793830925501289</a> <br /><br /><a href="https://www.scopus.com/pages/publications/105017178132?origin=resultslist" target="_blank" rel="noreferrer noopener">https://www.scopus.com/pages/publications/105017178132?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
Alex A., Department of Mathematics, CHRIST (Deemed to be University), Karnataka, Bangalore, 560029, India; Sangeetha V., Department of Mathematics, CHRIST (Deemed to be University), Karnataka, Bangalore, 560029, India
Description
An account of the resource
In graphs, several domination parameters have been introduced by incorporating a combination of the existing ones. A secure equitable domination is a domination in which the dominating set admits the properties of both; secure as well as equitable dominating sets. An equitable dominating set D of a graph G is said to be secure equitable dominating set, if for every u ? V?D, there exists a vertex v ? D such that u and v are adjacent and {D?{v}}?{u} is an equitable dominating set of G. The minimum cardinality of a secure equitable dominating set of G is called the secure equitable domination number of G. In this paper, we study certain cases were the secure domination, the equitable domination and the secure equitable domination bounds are equal. Moreover, we establish the bounds of secure equitable domination number of the Cartesian product of graphs. 2025 World Scientific Publishing Company.
Subject
The topic of the resource
Cartesian product; Equitable domination; secure domination; secure equitable domination
Publisher
An entity responsible for making the resource available
World Scientific
Relation
A related resource
ISSN: 17938309;
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
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
Madhumitha, S.; Naduvath, Sudev
Title
A name given to the resource
Domination-related colorings of n-inordinate invariant intersection 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
Discrete Mathematics, Algorithms and Applications;Issue;;Article No.;2550098;
Identifier
An unambiguous reference to the resource within a given context
<a href="https://doi.org/10.1142/S1793830925500983" target="_blank" rel="noreferrer noopener">https://doi.org/10.1142/S1793830925500983</a> <br /><br /><a href="https://www.scopus.com/pages/publications/105009427784?origin=resultslist" target="_blank" rel="noreferrer noopener">https://www.scopus.com/pages/publications/105009427784?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
Madhumitha S., Department of Mathematics, Christ University, Bangalore, India; Naduvath S., Department of Mathematics, Christ University, Bangalore, India
Description
An account of the resource
Algebraic graph theory is an intriguing field of research in which various properties of graphs constructed based on algebraic structures are studied. Interlacing two important structural aspects of graphs namely, coloring, and domination in graphs, several domination-related colorings of graphs are introduced in the literature. In this paper, we study such domination-related colorings of algebraic graphs, called the n-inordinate invariant intersection graphs and the n-inordinate invariant non-intersection graphs, that are constructed based on the symmetric group. 2025 World Scientific Publishing Company.
Subject
The topic of the resource
coloring; domination; domination-related colorings; Invariant intersection graphs; n-inordinate invariant intersection graphs
Publisher
An entity responsible for making the resource available
World Scientific
Relation
A related resource
ISSN: 17938309;
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
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
Iyer, Akshay Vishnuprakash; Kureethara, Joseph Varghese
Title
A name given to the resource
Forbidden subgraphs and prohibited colorings for vertex identification in 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
Discrete Mathematics, Algorithms and Applications;Issue;;Article No.;2550092;
Identifier
An unambiguous reference to the resource within a given context
<a href="https://doi.org/10.1142/S1793830925500922" target="_blank" rel="noreferrer noopener">https://doi.org/10.1142/S1793830925500922</a> <br /><br /><a href="https://www.scopus.com/pages/publications/105007645398?origin=resultslist" target="_blank" rel="noreferrer noopener">https://www.scopus.com/pages/publications/105007645398?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
Iyer A.V., Department of Mathematics, CHRIST (Deemed to be University), Karnataka, Bengaluru, 560029, India; Kureethara J.V., Department of Mathematics, CHRIST (Deemed to be University), Karnataka, Bengaluru, 560029, India
Description
An account of the resource
A red-white coloring of a graph G of diameter d is done by assigning the colors red and white to the vertices of the graph such that, there should be at least one red vertex. Then, each of the vertices is assigned a vector of length d called code in which the value of ith coordinate is equal to the number of red-colored vertices at distance i from this vertex, i ? {1, 2, 3,,d}. A red-white coloring when the code assigned to each vertex is different than that coloring is called an ID-coloring and a graph which has an ID-coloring is an ID-graph. The minimum number of vertices required to be colored red to get an ID-coloring is called the ID-number. ID-coloring is not possible for all graphs. There exist many properties which prevent ID-coloring. In this paper, we explore some forbidden induced subgraphs and certain prohibited red-white colorings which prevent the existence of ID-coloring. 2025 World Scientific Publishing Company.
Subject
The topic of the resource
distance; Graph coloring; ID-coloring; ID-graph
Publisher
An entity responsible for making the resource available
World Scientific
Relation
A related resource
ISSN: 17938309;
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
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
Madhumitha, S.; Naduvath, Sudev
Title
A name given to the resource
Centrality-based graph entropy and sensitivity analysis of n-inordinate invariant intersection 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
Discrete Mathematics, Algorithms and Applications;Issue;;Article No.;2550083;
Identifier
An unambiguous reference to the resource within a given context
<a href="https://doi.org/10.1142/S1793830925500831" target="_blank" rel="noreferrer noopener">https://doi.org/10.1142/S1793830925500831</a> <br /><br /><a href="https://www.scopus.com/pages/publications/105007329302?origin=resultslist" target="_blank" rel="noreferrer noopener">https://www.scopus.com/pages/publications/105007329302?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
Madhumitha S., Department of Mathematics, Christ University, Bangalore, India; Naduvath S., Department of Mathematics, Christ University, Bangalore, India
Description
An account of the resource
Centrality is a real-valued function on the vertex set of a graph that helps in determining the vitality of its vertices. Graph entropy gives the structural information of complex networks, based on some information of the network entities. An algebraic intersection graph called the n-inordinate invariant intersection graph has been constructed from the symmetric group and its structural properties are being studied, in the literature. In this paper, we discuss the centrality measures and the graph entropy of the n-inordinate invariant intersection graphs and their complements, and analyze the sensitivity of these networks, based on the centrality measures of their vertices. 2020 World Scientific Publishing Company.
Subject
The topic of the resource
centrality measures; entropy; Invariant intersection graph; n-inordinate invariant intersection graphs; sensitivity analysis
Publisher
An entity responsible for making the resource available
World Scientific
Relation
A related resource
ISSN: 17938309;
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
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
Madhumitha, S.; Naduvath, Sudev
Title
A name given to the resource
Coalition partitions of n-inordinate invariant intersection 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
Discrete Mathematics, Algorithms and Applications;Issue;;Article No.;2550073;
Identifier
An unambiguous reference to the resource within a given context
<a href="https://doi.org/10.1142/S1793830925500739" target="_blank" rel="noreferrer noopener">https://doi.org/10.1142/S1793830925500739</a> <br /><br /><a href="https://www.scopus.com/pages/publications/105005063048?origin=resultslist" target="_blank" rel="noreferrer noopener">https://www.scopus.com/pages/publications/105005063048?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
Madhumitha S., Department of Mathematics, Christ University, Bangalore, India; Naduvath S., Department of Mathematics, Christ University, Bangalore, India
Description
An account of the resource
A class of algebraic intersection graphs, called the n-inordinate invariant intersection graphs, has been introduced and various properties of these graphs are investigated in the literature. Domination is an important structural property in graphs and the notion of coalition in graphs has been recently introduced based on different types of domination in graphs. In this article, we analyse the structure of the n-inordinate invariant intersection graphs by investigating certain variants of domination based coalition partitions of them. 2025 World Scientific Publishing Company.
Subject
The topic of the resource
coalition; domination; Invariant intersection graphs; n-inordinate invariant intersection graphs; symmetric groups
Publisher
An entity responsible for making the resource available
World Scientific
Relation
A related resource
ISSN: 17938309;
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
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
Mathias, Anisha Jean; Sangeetha, Veerasamy; Acharya, Mukti
Title
A name given to the resource
A study on the restrained domination number in diverse families of derived signed 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
Discrete Mathematics, Algorithms and Applications;Issue;;Article No.;2550037;
Identifier
An unambiguous reference to the resource within a given context
<a href="https://doi.org/10.1142/S1793830925500375" target="_blank" rel="noreferrer noopener">https://doi.org/10.1142/S1793830925500375</a> <br /><br /><a href="https://www.scopus.com/pages/publications/86000649506?origin=resultslist" target="_blank" rel="noreferrer noopener">https://www.scopus.com/pages/publications/86000649506?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
Mathias A.J., Department of Mathematics, CHRIST (Deemed to Be University), Karnataka, Bengaluru, 560029, India; Sangeetha V., Department of Mathematics, CHRIST (Deemed to Be University), Karnataka, Bengaluru, 560029, India; Acharya M., Department of Mathematics, CHRIST (Deemed to Be University), Karnataka, Bengaluru, 560029, India
Description
An account of the resource
A derived graph is obtained by applying a specific graph operation to a given graph G. A set D of vertices in a signed graph ? is a restrained dominating set of ? if D is a restrained dominating set of the underlying graph |?|, and every cycle formed by the edges connecting D to V \D and those within V \D is balanced. The restrained domination number ?r(?) is the minimum cardinality of a restrained dominating set of ?. In this paper, we establish results on the restrained domination number for derived signed graphs, including line signed graphs, semi-total point signed graphs, semi-total line signed graphs, and total signed graphs and we also examine their structural properties in relation to their restrained domination number. 2025 World Scientific Publishing Company.
Subject
The topic of the resource
line signed graph; Restrained domination number; semi-total line signed graph; semi-total point signed graph; total signed graph
Publisher
An entity responsible for making the resource available
World Scientific
Relation
A related resource
ISSN: 17938309;
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
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
Mulloor, John Joy; Sangeetha, V.
Title
A name given to the resource
Restrained geodetic domination polynomial
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
Discrete Mathematics, Algorithms and Applications;Volume;18;Issue;2;Article No.;2550033;
Identifier
An unambiguous reference to the resource within a given context
<a href="https://doi.org/10.1142/S1793830925500338" target="_blank" rel="noreferrer noopener">https://doi.org/10.1142/S1793830925500338</a> <br /><br /><a href="https://www.scopus.com/pages/publications/86000598438?origin=resultslist" target="_blank" rel="noreferrer noopener">https://www.scopus.com/pages/publications/86000598438?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
Mulloor J.J., Department of Mathematics, CHRIST, Deemed to be University, Bengaluru, 560029, India; Sangeetha V., Department of Mathematics, CHRIST, Deemed to be University, Bengaluru, 560029, India
Description
An account of the resource
For a connected graph G = (V, E), a vertex subset S of G is said to be a restrained geodetic dominating set if S is both geodetic and dominating set of G and also, the subgraph induced by V ? S consists of no vertex with degree zero. From the study of domination polynomial and geodetic domination polynomial, we have initiated the study on restrained geodetic domination polynomial. World Scientific Publishing Company.
Subject
The topic of the resource
Domination number; domination polynomial; geodetic domination polynomial; restrained geodetic domination polynomial
Publisher
An entity responsible for making the resource available
World Scientific
Relation
A related resource
ISSN: 17938309;
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
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
Antony, Toby B.; Naduvath, Sudev
Title
A name given to the resource
Further studies on chromatic completion of 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
Discrete Mathematics, Algorithms and Applications;Volume;18;Issue;2;Article No.;2550032;
Identifier
An unambiguous reference to the resource within a given context
<a href="https://doi.org/10.1142/S1793830925500326" target="_blank" rel="noreferrer noopener">https://doi.org/10.1142/S1793830925500326</a> <br /><br /><a href="https://www.scopus.com/pages/publications/105008671341?origin=resultslist" target="_blank" rel="noreferrer noopener">https://www.scopus.com/pages/publications/105008671341?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
Antony T.B., Department of Mathematics, Christ University, Bangalore, India; Naduvath S., Department of Mathematics, Christ University, Bangalore, India
Description
An account of the resource
The chromatic completion graph of G with respect to a proper vertex coloring c of G, denoted by Gc?, is the graph obtained by adding all possible edges to G without violating the proper coloring protocol. The maximum number of edges added to G to obtain the chromatic completion graph is the chromatic completion number ??(G). Equitable chromatic completion graph Ge? of a graph G and equitable chromatic completion number ??e(G) are the equitable analogues of Gc? and ??(G), respectively. In this paper, we present various structural aspects of chromatic completion graphs and equitable chromatic completion graphs. Also, the chromatic completion and the related parameter are described in terms of adjacency matrix and color matrix of graphs. The equitable chromatic completion graph is shown to be a Tur graph. More relevantly, we obtained the equitable chromatic completion number of an arbitrary graph G. World Scientific Publishing Company.
Subject
The topic of the resource
chromatic completion graph; chromatic completion number; equitable chromatic completion graph; equitable chromatic completion number; Proper edge
Publisher
An entity responsible for making the resource available
World Scientific
Relation
A related resource
ISSN: 17938309;
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
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
Pious, Merlin; Madhumitha, S.; Naduvath, Sudev
Title
A name given to the resource
Some improper injective coloring parameters of 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
Discrete Mathematics, Algorithms and Applications;Volume;18;Issue;2;Article No.;2550026;
Identifier
An unambiguous reference to the resource within a given context
<a href="https://doi.org/10.1142/S1793830925500260" target="_blank" rel="noreferrer noopener">https://doi.org/10.1142/S1793830925500260</a> <br /><br /><a href="https://www.scopus.com/pages/publications/85219118090?origin=resultslist" target="_blank" rel="noreferrer noopener">https://www.scopus.com/pages/publications/85219118090?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
Pious M., Department of Mathematics, Christ University, Bangalore, India; Madhumitha S., Department of Mathematics, Christ University, Bangalore, India; Naduvath S., Department of Mathematics, Christ University, Bangalore, India
Description
An account of the resource
Any vertex coloring protocol of a graph can be viewed as a random experiment of assigning colors to the vertices, whose random variable is defined as the number of vertices assigned a specific color in that coloring. Based on this idea, the statistical parameters of mean and variance have been extended to chromatic mean and chromatic variance for various proper vertex colorings of graphs in the literature. In this paper, the ideas of chromatic mean and chromatic variance of graphs concerning their improper injective coloring are introduced and determined for certain standard graphs. World Scientific Publishing Company.
Subject
The topic of the resource
chromatic mean; chromatic sum; chromatic variance; Improper coloring; injective coloring
Publisher
An entity responsible for making the resource available
World Scientific
Relation
A related resource
ISSN: 17938309;
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