562
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
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 Automatic Target Recognition (ATR) using Inverse Synthetic Aperture Radar Images
Subject
The topic of the resource
Automatic Target Recognition; Deep learning; Feature extraction; Image Classification; ISAR Image Detection; Ship Classification
Description
An account of the resource
Inverse Synthetic Aperture Radar (ISAR) is used to image sea surface targets during day/night and all-weather capabilities for applications such as coastal surveillance, ship self-defense, suppression of drug trafficking etc. Hence automating classification of ships by means of machine learning methods has become more significant. Typical classification approaches consist of pre-processing, feature extraction and processing by classifiers. Image processing techniques are applied for pre-processing ISAR images. Transformation invariant features are then extracted to which classifiers such as SVM, Neural Networks (NNs) are applied. The performance of these algorithms depend on the manually chosen features and is trained to perform well for different target profiles. The target image (profile of target) varies depending on the target type, aspect angle and motion introduced due to different sea states. In addition, Deep learning methods are also being explored for classification of ships. The challenge is to classify ships for different sea conditions and image acquisition parameters with limited database and processing resource. 2023 IEEE.
Creator
An entity primarily responsible for making the resource
Sudarson Rama Perumal T.; Gaurav G.S.; Helen Josephine V.L.; Joshua Samuel Raj R.
Source
A related resource from which the described resource is derived
6th International Conference on Inventive Computation Technologies, ICICT 2023 - Proceedings, pp. 953-956.
Publisher
An entity responsible for making the resource available
Institute of Electrical and Electronics Engineers Inc.
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.1109/ICICT57646.2023.10134428" target="_blank" rel="noreferrer noopener">https://doi.org/10.1109/ICICT57646.2023.10134428</a>
<br /><br /><a href="https://www.scopus.com/inward/record.uri?eid=2-s2.0-85163540791&doi=10.1109%2FICICT57646.2023.10134428&partnerID=40&md5=1d810dbce0359215bca2aca7ef444f55" target="_blank" rel="noreferrer noopener">https://www.scopus.com/inward/record.uri?eid=2-s2.0-85163540791&doi=10.1109%2fICICT57646.2023.10134428&partnerID=40&md5=1d810dbce0359215bca2aca7ef444f55</a>
Rights
Information about rights held in and over the resource
Restricted Access
Relation
A related resource
ISBN: 979-835039849-6
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
Sudarson Rama Perumal T., Dept. of CSE, Rohini College of Engineering and Technology, TamilNadu, India; Gaurav G.S., Dept. of. ISE, CMR Institute of Technology, Bengaluru, India; Helen Josephine V.L., Business Analytics, School of Business and Management, Christ University, Bangalore, India; Joshua Samuel Raj R., Faculty of EDICT, Bahrain Polytechnic, Isa Town, Bahrain
-
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
Note
Faculty Publications- notes
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
Rathi, Suba; M N, Nirmala
Title
A name given to the resource
On becoming a demanding Community: Neelam and its March for Justice
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
Contemporary South Asia;Volume;33;Issue;4;pp.748-756
Identifier
An unambiguous reference to the resource within a given context
<a href="https://doi.org/10.1080/09584935.2025.2530387" target="_blank" rel="noreferrer noopener">https://doi.org/10.1080/09584935.2025.2530387</a> <br /><br /><a href="https://www.scopus.com/pages/publications/105011760186?origin=resultslist" target="_blank" rel="noreferrer noopener">https://www.scopus.com/pages/publications/105011760186?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
Rathi S., Department of English and Cultural Studies, Christ (Deemed to be University), Bangalore, India; M N N., Department of Media Studies, Christ (Deemed to be University), Bangalore, India
Description
An account of the resource
The Neelam Panpattu Maiyam (Neelam Cultural Centre), an anti-caste socio-cultural movement based in Tamil Nadu, has emerged as a political force following its March for Justice rally in response to the murder of Dalit leader, K. Armstrong of Bahujan Samaj Party (BSP). The rally caused unease not only among mainstream political parties but also within certain Dalit political factions, with the media claiming it created divisions within Dalit politics. However, the movement, with strong Dalit assertions, confronts the Dravidian political power of the state head-on, which chose to remain silent about the murder. In contrast to those Dalit leaders who appease the state apparatus by compromising Dalit rights, Neelam demanded elected Dalit leaders to firmly stand for the Dalit cause. Given this recent political upheaval, this study delves into Neelams evolving political role in becoming a more vocal and influential force in contemporary political discourse against caste-based injustices, highlighting the significant impact of the March for Justice rally within and beyond the Dalit politics in the state. 2025 Informa UK Limited, trading as Taylor & Francis Group.
Subject
The topic of the resource
Dalit politics; Neelam; Ranjith; social movement; Tamil Nadu
Publisher
An entity responsible for making the resource available
Routledge
Relation
A related resource
ISSN: 9584935;
Language
A language of the resource
English
Type
The nature or genre of the resource
Notes
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 bivariate Teissier model using Copula: dependence properties, and case studies
Subject
The topic of the resource
Applications; Bayesian; Bivariate continuous model; Copula; Dependence; FGM; Inference; MCMC; Modelling; Teissier
Description
An account of the resource
To precisely represent bivariate continuous variables, this work presents an innovative approach that emphasizes the interdependencies between the variables. The technique is based on the Teissier model and the Farlie-Gumbel-Morgenstern (FGM) copula and seeks to create a complete framework that captures every aspect of associated occurrences. The work addresses data variability by utilizing the oscillatory properties of the FGM copula and the flexibility of the Teissier model. Both theoretical formulation and empirical realization are included in the evolution, which explains the joint cumulative distribution function F(z1,z2), the marginals F(z1) and F(z2), and the probability density function (PDF) f(z1,z2). The novel modeling of bivariate lifetime phenomena that combines the adaptive properties of the Teissier model with the oscillatory characteristics of the FGM copula represents the contribution. The study emphasizes the effectiveness of the strategy in controlling interdependencies while advancing academic knowledge and practical application in bivariate modelling. In parameter estimation, maximum likelihood and Bayesian paradigms are employed through the use of the Markov Chain Monte Carlo (MCMC). Theorized models are examined closely using rigorous model comparison techniques. The relevance of modern model paradigms is demonstrated by empirical findings from the Burr dataset. The Author(s) under exclusive licence to The Society for Reliability Engineering, Quality and Operations Management (SREQOM), India and The Division of Operation and Maintenance, Lulea University of Technology, Sweden 2024.
Creator
An entity primarily responsible for making the resource
Tyagi S.
Source
A related resource from which the described resource is derived
International Journal of System Assurance Engineering and Management, Vol-15, No. 6, pp. 2483-2499.
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
2024-01-01
Identifier
An unambiguous reference to the resource within a given context
<a href="https://doi.org/10.1007/s13198-024-02266-2" target="_blank" rel="noreferrer noopener">https://doi.org/10.1007/s13198-024-02266-2</a>
<br /><br /><a href="https://www.scopus.com/inward/record.uri?eid=2-s2.0-85186195351&doi=10.1007%2Fs13198-024-02266-2&partnerID=40&md5=77656a54fbed762e8174507ae79d040f" target="_blank" rel="noreferrer noopener">https://www.scopus.com/inward/record.uri?eid=2-s2.0-85186195351&doi=10.1007%2fs13198-024-02266-2&partnerID=40&md5=77656a54fbed762e8174507ae79d040f</a>
Rights
Information about rights held in and over the resource
Restricted Access
Relation
A related resource
ISSN: 9756809
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
Tyagi S., Department of Statistics and Data Science, 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
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 BLOCK-RELATED DERIVED GRAPHS
Subject
The topic of the resource
block cut point graph of a graph; block graph of a graph; block-degree; cut-degree
Description
An account of the resource
This paper introduces and analyses the block-degree of a vertex and the cut-degree of a block. The block-degree of a vertex v is the number of blocks containing v. The cut-degree of a block b is the number of cut vertices of G contained in b. The block-degree sequence of cut vertices of the graph and the cut-degree sequence of the graph are defined. A few characterizations of the block-degree and cut-degree sequence of the graph are established. Given a graph, its block graph (B(G)) is a graph where each vertex represents a block, and two vertices are connected if their blocks intersect. The number of cut vertices of B(G) is determined. Further, an investigation is carried out on the traversability of B(G). A block cutpoint graph (BC(G)) of a graph represents a graph where each vertex corresponds to either a block or a cut vertex, and two vertices are connected if one represents a block and the other represents a cut vertex contained within that block. The properties of BC(G) and its iterations are studied. The graph G for which BC(G) is a perfect m-ary tree is characterized. 2024, Canadian University of Dubai. All rights reserved.
Creator
An entity primarily responsible for making the resource
Baskar N.; Mangam T.A.; Rohith Raja M.
Source
A related resource from which the described resource is derived
Gulf Journal of Mathematics, Vol-18, No. 2, pp. 70-86.
Publisher
An entity responsible for making the resource available
Canadian University of Dubai
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.56947/gjom.v18i2.2284" target="_blank" rel="noreferrer noopener">https://doi.org/10.56947/gjom.v18i2.2284</a>
<br /><br /><a href="https://www.scopus.com/inward/record.uri?eid=2-s2.0-85212503722&doi=10.56947%2Fgjom.v18i2.2284&partnerID=40&md5=36e92e60554e520a5269434796adbad0" target="_blank" rel="noreferrer noopener">https://www.scopus.com/inward/record.uri?eid=2-s2.0-85212503722&doi=10.56947%2fgjom.v18i2.2284&partnerID=40&md5=36e92e60554e520a5269434796adbad0</a>
Rights
Information about rights held in and over the resource
All Open Access; Hybrid Gold Open Access
Relation
A related resource
ISSN: 23094966
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
Baskar N., Department of Mathematics, CHRIST (Deemed to be University), Bengaluru, India; Mangam T.A., Department of Mathematics, CHRIST (Deemed to be University), Bengaluru, India; Rohith Raja M., Department of Mathematics, CHRIST (Deemed to be University), Bengaluru, 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 building up a closer psychic distance as a fundamental ground of relationship between India and Korea: Focusing on Jeonlanam-Do in Korea
Subject
The topic of the resource
IMS; India; international market selection; Jeonlanam-Do; Korea; psychic distance
Description
An account of the resource
The Uppsala model (Johanson and Wiedersheim-Paul, 1975) identifies cultural differences, market attractiveness, and core competence of nations or firms as the key factors affecting international market selection. Among these three factors, psychic distance caused by cultural differences is regarded as the most important factor. However, the psychic distance between India and Korea is not very close. The main objective of this paper is to examine the ways to boost economic relationships between India and Korea by building up a closer relationship of psychic distance. We suggest Jeonlanam-Do including Gwangju Metropolitan City (JDGC) in Korea as a stepping stone to make both countries' psychic distance closer as JD has several common grounds of intangible assets with India which includes its adherence to democracy, human rights and peace; the diverse food culture; and the religious zeal to Buddhism. We propose these common interests as a way to enhance the awareness of national brand 'India' in Korea which will attribute to a strategically developed economic relationship between Korea and India. 2022 Inderscience Enterprises Ltd.. All rights reserved.
Creator
An entity primarily responsible for making the resource
Park D.H.; Cheriyan N.K.; Yeon G.
Source
A related resource from which the described resource is derived
International Journal of Business Excellence, Vol-26, No. 3, pp. 370-377.
Publisher
An entity responsible for making the resource available
Inderscience Publishers
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.1504/IJBEX.2022.122474" target="_blank" rel="noreferrer noopener">https://doi.org/10.1504/IJBEX.2022.122474</a>
<br /><br /><a href="https://www.scopus.com/inward/record.uri?eid=2-s2.0-85129229067&doi=10.1504%2FIJBEX.2022.122474&partnerID=40&md5=d4b0f3ac728257e83923e3029c7d5b49" target="_blank" rel="noreferrer noopener">https://www.scopus.com/inward/record.uri?eid=2-s2.0-85129229067&doi=10.1504%2fIJBEX.2022.122474&partnerID=40&md5=d4b0f3ac728257e83923e3029c7d5b49</a>
Rights
Information about rights held in and over the resource
Restricted Access
Relation
A related resource
ISSN: 17560047
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
Park D.H., Graduate School of Business, Chonnam National University, Gwangju, South Korea; Cheriyan N.K., Department of Commerce, CHRIST (Deemed to Be University), Bangalore, India; Yeon G., Department of Economics, 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
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
Jayakumar, Gokul S.; Sangeetha, V.
Title
A name given to the resource
On C-Perfection of Modular 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
Springer Proceedings in Mathematics and Statistics;Volume;484;pp.107-115
Identifier
An unambiguous reference to the resource within a given context
<a href="https://doi.org/10.1007/978-981-96-1505-6_11" target="_blank" rel="noreferrer noopener">https://doi.org/10.1007/978-981-96-1505-6_11</a> <br /><br /><a href="https://www.scopus.com/pages/publications/105002578451?origin=resultslist" target="_blank" rel="noreferrer noopener">https://www.scopus.com/pages/publications/105002578451?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
Jayakumar G.S., CHRIST (Deemed to be University), Karnataka, Bangalore, India; Sangeetha V., CHRIST (Deemed to be University), Karnataka, Bangalore, India
Description
An account of the resource
A graph G is said to be C-perfect if, for all induced subgraphs H of G, the induced cycle independence number is equal to its corresponding induce cycle covering number, where every vertex in H belongs to at least one cycle in H. This article deals with the study on C-perfection of modular product of graphs. Through this article, we study various structural properties of C-perfect modular product of graphs and also characterize them. The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.
Subject
The topic of the resource
C-perfect graphs; Modular product
Publisher
An entity responsible for making the resource available
Springer
Relation
A related resource
ISSN: 21941009; ISBN: 978-981961504-9;
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
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 C-Perfection of Tensor Product of Graphs
Subject
The topic of the resource
C-perfect graphs; Graph minors; Perfect graphs; Product graphs; Tensor product
Description
An account of the resource
A graph G is C-perfect if, for each induced subgraph H in G, the induced cycle independence number of H is equal to its induced cycle covering number. Here, the induced cycle independence number of a graph G is the cardinality of the largest vertex subset of G, whose elements do not share a common induced cycle, and induced cycle covering number is the minimum number of induced cycles in G that covers the vertex set of G. C-perfect graphs are characterized as series-parallel graphs that do not contain any induced subdivisions of K2,3, in literature. They are also isomorphic to the class of graphs that has an IC-tree. In this article, we examine the C-perfection of tensor product of graphs, also called direct product or Kronecker product. The structural properties of C-perfect tensor product of graphs are studied. Further, a characterization for C-perfect tensor product of graphs is obtained. The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2024.
Creator
An entity primarily responsible for making the resource
Jayakumar G.S.; Sangeetha V.
Source
A related resource from which the described resource is derived
Lecture Notes in Networks and Systems, Vol-865, pp. 235-249.
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-9043-6_20" target="_blank" rel="noreferrer noopener">https://doi.org/10.1007/978-981-99-9043-6_20</a>
<br /><br /><a href="https://www.scopus.com/inward/record.uri?eid=2-s2.0-85190389132&doi=10.1007%2F978-981-99-9043-6_20&partnerID=40&md5=3c934868d2e78f4df4a19a70539532a6" target="_blank" rel="noreferrer noopener">https://www.scopus.com/inward/record.uri?eid=2-s2.0-85190389132&doi=10.1007%2f978-981-99-9043-6_20&partnerID=40&md5=3c934868d2e78f4df4a19a70539532a6</a>
Rights
Information about rights held in and over the resource
Restricted Access
Relation
A related resource
ISSN: 23673370; ISBN: 978-981999042-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
Jayakumar G.S., CHRIST (Deemed to be University), Karnataka, Bangalore, 560029, India; Sangeetha V., CHRIST (Deemed to be University), Karnataka, Bangalore, 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
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 certain chromatic topological indices of some Mycielski graphs
Subject
The topic of the resource
Chromatic Zagreb indices; Irregularity indices; Mycielski graphs
Description
An account of the resource
As a coloring analogue of different Zagreb indices, in the recent literature, the notion of chromatic Zagreb indices has been introduced and studied for some basic graph classes in trees. In this paper, we study the chromatic Zagreb indices and chromatic irregularity indices of some special classes of graphs called Mycielski graphs of paths and cycles. 2020 Yarmouk University. All rights reserved.
Creator
An entity primarily responsible for making the resource
Rose S.; Naduvath S.
Source
A related resource from which the described resource is derived
Jordan Journal of Mathematics and Statistics, Vol-13, No. 4, pp. 487-503.
Publisher
An entity responsible for making the resource available
Yarmouk University
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>
<br /><br /><a href="https://www.scopus.com/inward/record.uri?eid=2-s2.0-85118982224&partnerID=40&md5=0182c9d5b1fdfa027a4a8db216cc1422" target="_blank" rel="noreferrer noopener">https://www.scopus.com/inward/record.uri?eid=2-s2.0-85118982224&partnerID=40&md5=0182c9d5b1fdfa027a4a8db216cc1422</a>
Rights
Information about rights held in and over the resource
Restricted Access
Relation
A related resource
ISSN: 20757905
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
Rose S., Department of Mathematics, St. Mary's College, Kerala, Thrissur, India; Naduvath S., Department of Mathematics, CHRIST (Deemed to be University), 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
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 Certain J-Colouring Parameters of Graphs
Subject
The topic of the resource
J-colouring; J-colouring mean; J-colouring number; J-colouring variance
Description
An account of the resource
In this paper, a new type of colouring called J-colouring is introduced. This colouring concept is motivated by the newly introduced invariant called the rainbow neighbourhood number of a graph. The study ponders on maximal colouring opposed to minimum colouring. An upper bound for a connected graph is presented, and a number of explicit results are presented for cycles, complete graphs, wheel graphs and for a complete l-partite graph. 2019, The National Academy of Sciences, India.
Creator
An entity primarily responsible for making the resource
Naduvath S.
Source
A related resource from which the described resource is derived
National Academy Science Letters, Vol-43, No. 1, pp. 53-57.
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-019-00805-1" target="_blank" rel="noreferrer noopener">https://doi.org/10.1007/s40009-019-00805-1</a>
<br /><br /><a href="https://www.scopus.com/inward/record.uri?eid=2-s2.0-85069860865&doi=10.1007%2Fs40009-019-00805-1&partnerID=40&md5=dde799b98ad8b09aeb99aa24a8d39e9b" target="_blank" rel="noreferrer noopener">https://www.scopus.com/inward/record.uri?eid=2-s2.0-85069860865&doi=10.1007%2fs40009-019-00805-1&partnerID=40&md5=dde799b98ad8b09aeb99aa24a8d39e9b</a>
Rights
Information about rights held in and over the resource
All Open Access; Green Open 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), Bengaluru, 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
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 certain topological indices of signed graphs
Subject
The topic of the resource
Gutman indices; Negative Zagreb indices; Net-imbalance; Positive Zagreb indices; Signed imbalance indices; Zagreb net-indices
Description
An account of the resource
The first Zagreb index of a graph G is the sum of squares of the vertex degrees in a graph and the second Zagreb index of G is the sum of products of degrees of adjacent vertices in G. The imbalance of an edge in G is the numerical difference of degrees of its end vertices and the irregularity of G is the sum of imbalances of all its edges. In this paper, we extend the concepts of these topological indices for signed graphs and discuss the corresponding results on signed graphs. 2020 the author(s).
Creator
An entity primarily responsible for making the resource
Naduvath S.; Kok J.
Source
A related resource from which the described resource is derived
Journal of Mathematical and Computational Science, Vol-10, No. 2, pp. 248-261.
Publisher
An entity responsible for making the resource available
SCIK Publishing Corporation
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.28919/jmcs/4324" target="_blank" rel="noreferrer noopener">https://doi.org/10.28919/jmcs/4324</a>
<br /><br /><a href="https://www.scopus.com/inward/record.uri?eid=2-s2.0-85079441400&doi=10.28919%2Fjmcs%2F4324&partnerID=40&md5=d24b7a825a2412a3346a4d7a98172ecd" target="_blank" rel="noreferrer noopener">https://www.scopus.com/inward/record.uri?eid=2-s2.0-85079441400&doi=10.28919%2fjmcs%2f4324&partnerID=40&md5=d24b7a825a2412a3346a4d7a98172ecd</a>
Rights
Information about rights held in and over the resource
All Open Access; Gold Open Access; Green Open Access
Relation
A related resource
ISSN: 19275307
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, India; Kok J., Department of Mathematics, CHRIST (Deemed to be University), Bangalore, 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
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 Circulant Completion of Graphs
Subject
The topic of the resource
? -completion; Circulant completion; Circulant completion graph; Circulant completion number; Circulant labelling; Circulant span
Description
An account of the resource
A graph G with vertex set as {v0, v1, v2,.., vn-1} corresponding to the elements of Zn, the group of integers under addition modulo n, is said to be a circulant graph if the edge set of G consists of all edges of the form {vi, vj} where (i-j)(modn)?S?{1,2,,n-1}, that is, closed under inverses. The set S is known as the connection set. In this paper, we present some techniques and characterisations which enable us to obtain a circulant completion graph of a given graph and thereby evaluate the circulant completion number. The obtained results provide the basic eligibilities for a graph to have a particular circulant completion graph. 2022, The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.
Creator
An entity primarily responsible for making the resource
Antony T.B.; Naduvath S.
Source
A related resource from which the described resource is derived
Lecture Notes in Networks and Systems, Vol-462, pp. 181-188.
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
2022-01-01
Identifier
An unambiguous reference to the resource within a given context
<a href="https://doi.org/10.1007/978-981-19-2211-4_15" target="_blank" rel="noreferrer noopener">https://doi.org/10.1007/978-981-19-2211-4_15</a>
<br /><br /><a href="https://www.scopus.com/inward/record.uri?eid=2-s2.0-85135040196&doi=10.1007%2F978-981-19-2211-4_15&partnerID=40&md5=6904684f11ae22dfad619a848ecf47c9" target="_blank" rel="noreferrer noopener">https://www.scopus.com/inward/record.uri?eid=2-s2.0-85135040196&doi=10.1007%2f978-981-19-2211-4_15&partnerID=40&md5=6904684f11ae22dfad619a848ecf47c9</a>
Rights
Information about rights held in and over the resource
Restricted Access
Relation
A related resource
ISSN: 23673370; ISBN: 978-981192210-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
Antony T.B., Department of Mathematics, CHRIST (Deemed to be University), Bangalore, India; Naduvath S., 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
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 Combinatorial Handoff Strategies for Spectrum Mobility in Ad Hoc Networks: A Comparative Review
Subject
The topic of the resource
Ad hoc networks; Cognitive radio; IEEE 802.11; LTE; MADM; Mobility; Spectrum handoff; Spectrum management functions; VANETs
Description
An account of the resource
Technological advancements have made communication on-the-go seamless. Spectrum mobility is a networking concept that involves access technologies that allow highly mobile nodes to communicate with each other. Ad-hoc networks are formed between mobile nodes where fixed infrastructure is not used. Due to the lack of such fixed access points for connectivity, the nodes involved make use of the best network available to transmit data. Due to heterogeneous networks involvement, the mobile nodes may face trouble finding the most optimal network for transmission. Existing technologies allow the nodes to select available networks, but the selection process is not optimized, leading to frequent switching. This leads to packet loss, low data rates, high delay, etc. Many researchers have proposed optimal strategies for performing handoff in wireless networks. This paper reviews combinatorial strategies that make use of multiple techniques to perform a handoff. 2022, The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.
Creator
An entity primarily responsible for making the resource
Thomas L.; Sandeep J.; Paulose J.; Smera C.; Amrutha K.; Jose J.; Kavipriya K.; Vijay S.
Source
A related resource from which the described resource is derived
Smart Innovation, Systems and Technologies, Vol-248, pp. 727-741.
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
2022-01-01
Identifier
An unambiguous reference to the resource within a given context
<a href="https://doi.org/10.1007/978-981-16-4177-0_72" target="_blank" rel="noreferrer noopener">https://doi.org/10.1007/978-981-16-4177-0_72</a>
<br /><br /><a href="https://www.scopus.com/inward/record.uri?eid=2-s2.0-85121786677&doi=10.1007%2F978-981-16-4177-0_72&partnerID=40&md5=2f25e5e88001ea9a54a7a6e876262261" target="_blank" rel="noreferrer noopener">https://www.scopus.com/inward/record.uri?eid=2-s2.0-85121786677&doi=10.1007%2f978-981-16-4177-0_72&partnerID=40&md5=2f25e5e88001ea9a54a7a6e876262261</a>
Rights
Information about rights held in and over the resource
Restricted Access
Relation
A related resource
ISSN: 21903018; ISBN: 978-981164176-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
Thomas L., CHRIST (Deemed To Be University), Bengaluru, 560029, India; Sandeep J., CHRIST (Deemed To Be University), Bengaluru, 560029, India; Paulose J., CHRIST (Deemed To Be University), Bengaluru, 560029, India; Smera C., CHRIST (Deemed To Be University), Bengaluru, 560029, India; Amrutha K., CHRIST (Deemed To Be University), Bengaluru, 560029, India; Jose J., CHRIST (Deemed To Be University), Bengaluru, 560029, India; Kavipriya K., CHRIST (Deemed To Be University), Bengaluru, 560029, India; Vijay S., 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
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 degree product induced signed graphs of graphs
Subject
The topic of the resource
degree product induced signed graph; degree-induced signed graph; induced signed graphs; Signed graphs
Description
An account of the resource
A signed graph is a graph with positive or negative signs assigned to edges. An induced signed graph is a signed graph constructed from a given graph according to some pre-defined protocols. An induced signed graph of a graph G is a signed graph in which each edge uv receives a sign (-1)|?(v)-?(u)|, where ?: V(G) ? ?. In this paper, we discuss degree product induced signed graphs and determine the structural properties of these signed graphs such as balancing, clustering, regularity and co-regularity. 2020 Author(s).
Creator
An entity primarily responsible for making the resource
Aniyan A.; Naduvath S.
Source
A related resource from which the described resource is derived
AIP Conference Proceedings, Vol-2261
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.0019097" target="_blank" rel="noreferrer noopener">https://doi.org/10.1063/5.0019097</a>
<br /><br /><a href="https://www.scopus.com/inward/record.uri?eid=2-s2.0-85095566106&doi=10.1063%2F5.0019097&partnerID=40&md5=761346e179b89efa4daff3fec26ca81c" target="_blank" rel="noreferrer noopener">https://www.scopus.com/inward/record.uri?eid=2-s2.0-85095566106&doi=10.1063%2f5.0019097&partnerID=40&md5=761346e179b89efa4daff3fec26ca81c</a>
Rights
Information about rights held in and over the resource
Restricted Access
Relation
A related resource
ISSN: 0094243X; ISBN: 978-073542021-2
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
Aniyan A., Department of Mathematics, CHRIST, Deemed to Be University, Banglore, India; Naduvath S., Department of Mathematics, CHRIST, Deemed to Be University, Banglore, India
-
https://archives.christuniversity.in/files/original/a8a319b6ac5dd340e6295685f4814a41.pdf
c7eef0e507e175ee728e65f8e12a4c8d
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
MPHIL
Mphil
Mphil Thesis
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 Degree Sequence of Total Graphs and the Order of the Graphs
Creator
An entity primarily responsible for making the resource
Thomas Jijo
Date
A point or period of time associated with an event in the lifecycle of the resource
2012
Source
A related resource from which the described resource is derived
Mathematics
Description
An account of the resource
In this dissertation we discuss about the degree sequence of total graphs of some general graphs. A total graph of G, denoted by T(G) has vertex set as the union of vertices and edges in G and vertices are adjacent in T(G) if they are adjacent or incident in G. We try to obtain the degree sequence of total graphs of particular graphs like complete graph, path, cycle, wheel and star, from the number of vertices of the given graph (without directly drawing the total graph). We also explain the decomposition of T(G) into G and K_(d_i )s where dis are degrees of each of the vertices in G, moreover discuss about the degree sequence of T(G)??T(Ge).
-
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 Equitable Chromatic Completion of Some Graph Classes
Description
An account of the resource
An edge of a properly vertex-colored graph is said to be a good edge if it has end vertices of different color. The chromatic completion graph of a graph G is a graph obtained by adding all possible good edges to G. The chromatic completion number of G is the maximum number of new good edges added to G. An equitable coloring of a graph G is a proper vertex coloring of G such that the difference of cardinalities of any two color classes is at most 1. In this paper, we discuss the chromatic completion graphs and chromatic completion number of certain graph classes, with respect to their equitable coloring. 2022 American Institute of Physics Inc.. All rights reserved.
Creator
An entity primarily responsible for making the resource
Antony T.B.; Naduvath S.
Source
A related resource from which the described resource is derived
AIP Conference Proceedings, Vol-2516
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
2022-01-01
Identifier
An unambiguous reference to the resource within a given context
<a href="https://doi.org/10.1063/5.0108544" target="_blank" rel="noreferrer noopener">https://doi.org/10.1063/5.0108544</a>
<br /><br /><a href="https://www.scopus.com/inward/record.uri?eid=2-s2.0-85144123121&doi=10.1063%2F5.0108544&partnerID=40&md5=7ef79dc49fbea149d4f9e655a27666a1" target="_blank" rel="noreferrer noopener">https://www.scopus.com/inward/record.uri?eid=2-s2.0-85144123121&doi=10.1063%2f5.0108544&partnerID=40&md5=7ef79dc49fbea149d4f9e655a27666a1</a>
Rights
Information about rights held in and over the resource
All Open Access; Bronze Open Access
Relation
A related resource
ISSN: 0094243X; ISBN: 978-073544234-4
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
Antony T.B., Department of Mathematics, CHRIST (Deemed to be University), Bangalore, India; Naduvath S., 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
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 equitable chromatic topological indices of some Mycielski graphs
Subject
The topic of the resource
chromatic irregularity indices; chromatic Zagreb indices; equitable chromatic irregularity indices; equitable chromatic Zagreb indices; Mycielski graphs
Description
An account of the resource
In recent years, the notion of chromatic Zagreb indices has been introduced and studied for certain basic graph classes, as a coloring parallel of different Zagreb indices. A proper coloring C of a graph G, which assigns colors to the vertices of G such that the numbers of vertices in any two color classes differ by at most one, is called an equitable coloring of G. In this paper, we introduce the equitable chromatic Zagreb indices and equitable chromatic irregularity indices of some special classes of graphs called Mycielski graphs of paths and cycles. 2020, SINUS Association. All rights reserved.
Creator
An entity primarily responsible for making the resource
Rose S.; Naduvath S.
Source
A related resource from which the described resource is derived
Creative Mathematics and Informatics, Vol-29, No. 2, pp. 221-229.
Publisher
An entity responsible for making the resource available
SINUS Association
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.37193/CMI.2020.02.13" target="_blank" rel="noreferrer noopener">https://doi.org/10.37193/CMI.2020.02.13</a>
<br /><br /><a href="https://www.scopus.com/inward/record.uri?eid=2-s2.0-85194823586&doi=10.37193%2FCMI.2020.02.13&partnerID=40&md5=2c16d684ef18e7ca5bacd4b9722acf91" target="_blank" rel="noreferrer noopener">https://www.scopus.com/inward/record.uri?eid=2-s2.0-85194823586&doi=10.37193%2fCMI.2020.02.13&partnerID=40&md5=2c16d684ef18e7ca5bacd4b9722acf91</a>
Rights
Information about rights held in and over the resource
Restricted Access
Relation
A related resource
ISSN: 1584286X
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
Rose S., DEPARTMENT OF MATHEMATICS, ST. MARYS COLLEGE, DEPARTMENT OF MATHEMATICS, KERALA, THRISSUR, India; Naduvath S., DEPARTMENT OF MATHEMATICS, CHRIST (DEEMED TO BE UNIVERSITY), 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 Equitable Near Proper Coloring of Certain Graph Classes
Description
An account of the resource
The non-availability of sufficient number of colors to color a graph leads to defective coloring problems. Coloring a graph with insufficient number of colors cause the end vertices of some edges receive the same color. Such edges with same colored end vertices are called as bad edges. The minimum number of bad edges obtained from an equitable near proper coloring of a graph G is known as equitable defective number. In this paper, we discuss the equitable near proper coloring of some families of graphs and we also determine the equitable defective number for the same. 2022 American Institute of Physics Inc.. All rights reserved.
Creator
An entity primarily responsible for making the resource
Jose S.; Naduvath S.
Source
A related resource from which the described resource is derived
AIP Conference Proceedings, Vol-2516
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
2022-01-01
Identifier
An unambiguous reference to the resource within a given context
<a href="https://doi.org/10.1063/5.0108430" target="_blank" rel="noreferrer noopener">https://doi.org/10.1063/5.0108430</a>
<br /><br /><a href="https://www.scopus.com/inward/record.uri?eid=2-s2.0-85144132912&doi=10.1063%2F5.0108430&partnerID=40&md5=858784b04a4a9e13e08337656e0f0779" target="_blank" rel="noreferrer noopener">https://www.scopus.com/inward/record.uri?eid=2-s2.0-85144132912&doi=10.1063%2f5.0108430&partnerID=40&md5=858784b04a4a9e13e08337656e0f0779</a>
Rights
Information about rights held in and over the resource
All Open Access; Bronze Open Access
Relation
A related resource
ISSN: 0094243X; ISBN: 978-073544234-4
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
Jose S., Department of Mathematics, CHRIST (Deemed to be University), Bangalore, India; Naduvath S., 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
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 equitable near proper coloring of graphs
Subject
The topic of the resource
equitable coloring; equitable near proper coloring; Improper coloring; near proper coloring
Description
An account of the resource
A defective vertex coloring of a graph is a coloring in which some adjacent vertices may have the same color. An edge whose adjacent vertices have the same color is called a bad edge. A defective coloring of a graph G with minimum possible number of bad edges in G is known as a near proper coloring of G. In this paper, we introduce the notion of equitable near proper coloring of graphs and determine the minimum number of bad edges obtained from an equitable near proper coloring of some graph classes. 2024 Azarbaijan Shahid Madani University.
Creator
An entity primarily responsible for making the resource
Jose S.; Samuel L.C.; Naduvath S.
Source
A related resource from which the described resource is derived
Communications in Combinatorics and Optimization, Vol-9, No. 1, pp. 131-143.
Publisher
An entity responsible for making the resource available
Azarbaijan Shahid Madani University
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.22049/CCO.2022.27240.1218" target="_blank" rel="noreferrer noopener">https://doi.org/10.22049/CCO.2022.27240.1218</a>
<br /><br /><a href="https://www.scopus.com/inward/record.uri?eid=2-s2.0-85187251230&doi=10.22049%2FCCO.2022.27240.1218&partnerID=40&md5=0fb6c94ed78f20a527c8bc32a3851563" target="_blank" rel="noreferrer noopener">https://www.scopus.com/inward/record.uri?eid=2-s2.0-85187251230&doi=10.22049%2fCCO.2022.27240.1218&partnerID=40&md5=0fb6c94ed78f20a527c8bc32a3851563</a>
Rights
Information about rights held in and over the resource
Restricted Access
Relation
A related resource
ISSN: 25382128
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
Jose S., Department of Mathematics, CHRIST (Deemed to be University), Karnataka, Bangalore, 560029, India; Samuel L.C., Department of Mathematics, CHRIST (Deemed to be University), Karnataka, Bangalore, 560029, India; Naduvath S., Department of Mathematics, CHRIST (Deemed to be University), Karnataka, Bangalore, 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
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 Equitable Near Proper Coloring of Mycielski Graph of Graphs
Subject
The topic of the resource
Equitable coloring; Equitable near-proper coloring; Mycielski graph; Near-proper coloring
Description
An account of the resource
When the available number of colors are less than that of the equitable chromatic number, there may be some edges whose end vertices receive the same color. These edges are called as bad edges. An equitable near-proper coloring of a graph G is a defective coloring in which the number of vertices in any two color classes differ by at most one and the resulting bad edges is minimized by restricting the number of color classes that can have adjacency among their own elements. In this paper, we investigate the equitable near-proper coloring of Mycielski graph of graphs and determine the equitable defective number of those graphs. 2021, The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.
Creator
An entity primarily responsible for making the resource
Jose S.; Naduvath S.
Source
A related resource from which the described resource is derived
Lecture Notes in Networks and Systems, Vol-290, pp. 331-339.
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-981-16-4486-3_37" target="_blank" rel="noreferrer noopener">https://doi.org/10.1007/978-981-16-4486-3_37</a>
<br /><br /><a href="https://www.scopus.com/inward/record.uri?eid=2-s2.0-85115082793&doi=10.1007%2F978-981-16-4486-3_37&partnerID=40&md5=bc64f77f939da872b4a1601ec9c5bde7" target="_blank" rel="noreferrer noopener">https://www.scopus.com/inward/record.uri?eid=2-s2.0-85115082793&doi=10.1007%2f978-981-16-4486-3_37&partnerID=40&md5=bc64f77f939da872b4a1601ec9c5bde7</a>
Rights
Information about rights held in and over the resource
Restricted Access
Relation
A related resource
ISSN: 23673370; ISBN: 978-981164485-6
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
Jose S., Department of Mathematics, CHRIST (Deemed to be University), Bangalore, Karnataka, India; Naduvath S., Department of Mathematics, 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 equitable near-proper coloring of some derived graph classes
Subject
The topic of the resource
equitable near-proper coloring; Mycielski graph; shadow graph; splitting graph
Description
An account of the resource
An equitable near-proper coloring of a graph G is a defective coloring in which the number of vertices in any two color classes differ by at most one and the bad edges obtained is minimized by restricting the number of color classes that can have adjacency among their own elements. This paper investigates the equitable near-proper coloring of some derived graph classes like Mycielski graphs, splitting graphs and shadow graphs. Jose S., Naduvath S., 2022.
Creator
An entity primarily responsible for making the resource
Jose S.; Naduvath S.
Source
A related resource from which the described resource is derived
Carpathian Mathematical Publications, Vol-14, No. 2, pp. 529-542.
Publisher
An entity responsible for making the resource available
Precarpathian National University
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.15330/cmp.14.2.529-542" target="_blank" rel="noreferrer noopener">https://doi.org/10.15330/cmp.14.2.529-542</a>
<br /><br /><a href="https://www.scopus.com/inward/record.uri?eid=2-s2.0-85146286489&doi=10.15330%2Fcmp.14.2.529-542&partnerID=40&md5=d5ef99d43390f293bcc8eaa75d250b07" target="_blank" rel="noreferrer noopener">https://www.scopus.com/inward/record.uri?eid=2-s2.0-85146286489&doi=10.15330%2fcmp.14.2.529-542&partnerID=40&md5=d5ef99d43390f293bcc8eaa75d250b07</a>
Rights
Information about rights held in and over the resource
All Open Access; Gold Open Access
Relation
A related resource
ISSN: 20759827
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
Jose S., Department of Mathematics, CHRIST (Deemed to be University), Karnataka, Bangalore, India; Naduvath S., Department of Mathematics, CHRIST (Deemed to be University), Karnataka, Bangalore, India