-
Article
A New Fuzzy-Based Color Reflectance Space with Selective Feature Extraction: Face Recognition Under Diversified Illuminations
Effective face recognition becomes challenging when significant facial features diminish due to variations in light energy distribution incident on images. Many existing face recognition techniques have neglec...
-
Article
Unique Response Roman Domination: Complexity and Algorithms
A function \(f :V(G) \rightarrow \{0, 1, 2\}\) f : ...
-
Chapter and Conference Paper
Multiresolution Analysis Based on Variants of Wavelet Transforms for Illumination Normalized Face Recognition
Face recognition has been recognized as an extensive biometric system in recent years that effectively identifies digital face images under any uncontrolled illumination situations. This often results in intra...
-
Chapter and Conference Paper
Parameterized Results on Acyclic Matchings with Implications for Related Problems
A matching M in a graph G is an acyclic matching if the subgraph of G induced by the endpoints of the edges of M is a forest. Given a graph G and a positive integer
-
Chapter and Conference Paper
Minimum Maximal Acyclic Matching in Proper Interval Graphs
Given a graph G, Min-Max-Acy-Matching is the problem of finding a maximal matching M in G of minimum cardinality such that the set of M-saturated vertices induces an acyclic subgraph in G. The decision version of...
-
Chapter and Conference Paper
\(\mathcal {P}\) -Matchings Parameterized by Treewidth
A matching is a subset of edges in a graph G that do not share an endpoint. A matching M is a \(\mathcal {P}\) -matching if the subgraph o...
-
Chapter and Conference Paper
Large Scale Double Density Dual Tree Complex Wavelet Transform Based Robust Feature Extraction for Face Recognition
Varying effects in face recognition often causes intrapersonal variations due to which efficient feature extraction is desirable. In this work, a significant feature extraction technique based on Double Densit...
-
Chapter and Conference Paper
On Two Variants of Induced Matchings
A matching M in a graph G is an induced matching if the subgraph of G induced by M is the same as the subgraph of G induced by $$S = \{v \in V...
-
Chapter and Conference Paper
On the Complexity of Minimum Maximal Acyclic Matchings
Given a graph G, Min-Max-Acy-Matching is the problem of finding a maximal matching M in G of minimum cardinality such that the set of M-saturated vertices induces an acyclic subgraph in G. Min-Max-Acy-Matching is...
-
Article
Maximum weight induced matching in some subclasses of bipartite graphs
A subset \(M\subseteq E\) M ⊆ E of edges of a graph \(G=(V,E)\) G = ( V , E ) is called a matching in G if no two edges in M share a common vertex. A matching M in G is called an induced matching if G
-
Chapter and Conference Paper
On the Complexity of Minimum Maximal Uniquely Restricted Matching
A subset \(M\subseteq E\) M ⊆ E of edges of a graph \(G=(V,E)\) G = ( V , E ) is called a matching if no two edges of M share a common vertex. A matching M in a graph G is called a uniquely restricted...
-
Chapter and Conference Paper
Acyclic Matching in Some Subclasses of Graphs
A subset \(M\subseteq E\) of edges of a graph \(G=(V,E)\) is called a matching if no two edges of M share a common vertex. A matching M in a graph G is called an acyclic matching if G[V(M)], the subgraph of G in...
-
Chapter
Nano-materials for Wastewater Treatment
Heavy metal and ionic contamination in wastewater and surface water has been reported in many parts of the world and studied as a major global issue. Their exposure in a trace amount is hazardous for human hea...
-
Article
Open AccessInduction of somatic embryos in cultures of Asparagus racemosus Willd: an endangered medicinally important plant
Somatic embryogenesis is one of the most popular in vitro regeneration methods for mass micropropagation. In the present study, somatic embryogenesis via zygotic embryos was studied in Asparagus racemosus Willd. ...
-
Chapter and Conference Paper
Dominating Induced Matching in Some Subclasses of Bipartite Graphs
Given a graph \(G=(V,E)\) , a set $$M\su...
-
Chapter
Metabolomics: An Emerging Technology for Soybean Improvement
Metabolomics is one of the most emerging technologies being used for crop improvement. It allows a comprehensive understanding of complex networks of biological processes, which will certainly help to accelera...
-
Chapter
Approaches, Applicability, and Challenges for Development of Climate-Smart Soybean
Soybean (Glycine max L.) is an economically important crop providing a great source for vegetable oil and protein. Yield losses of soybean under current climate change keep increasing, despite the progressive inc...
-
Article
Open AccessGenomic-assisted haplotype analysis and the development of high-throughput SNP markers for salinity tolerance in soybean
Soil salinity is a limiting factor of crop yield. The soybean is sensitive to soil salinity and a dominant gene, Glyma03g32900 is primarily responsible for salt-tolerance. The identification of high throughput an...
-
Article
Open AccessSoybean (Glycine max) SWEET gene family: insights through comparative genomics, transcriptome profiling and whole genome re-sequence analysis
SWEET (MtN3_saliva) domain proteins, a recently identified group of efflux transporters, play an indispensable role in sugar efflux, phloem loading, plant-pathogen interaction and reproductive tissue development....
