Catalogue Search | MBRL
Search Results Heading
Explore the vast range of titles available.
MBRLSearchResults
-
DisciplineDiscipline
-
Is Peer ReviewedIs Peer Reviewed
-
Reading LevelReading Level
-
Content TypeContent Type
-
YearFrom:-To:
-
More FiltersMore FiltersItem TypeIs Full-Text AvailableSubjectCountry Of PublicationPublisherSourceTarget AudienceDonorLanguagePlace of PublicationContributorsLocation
Done
Filters
Reset
81,523
result(s) for
"Labels"
Sort by:
Correction: Latchoumanane, V.; Varadhan, M. Antimagic Labeling for Product of Regular Graphs. Symmetry 2022, 14, 1235
2026
In Abstract and Keywords, Text correction: [...]
Journal Article
RETRACTED: ELrokh et al. On Cubic Roots Cordial Labeling for Some Graphs. Symmetry 2023, 15, 990
2024
The journal Symmetry retracts the article titled “On Cubic Roots Cordial Labeling for Some Graphs” [...]
Journal Article
Correction to: Multiple selective sweeps of ancient polymorphisms in and around LTalpha located in the MHC class III region on chromosome 6
2019
After publication of our article [1] we were notified that a few duplicate sentences were included on Figure 3 and Figure 4 legends.
Journal Article
The art and life of Fukuda Kodōjin : Japan's great poet and landscape artist
by
Marks, Andreas, author
,
Fukuda, Haritsu, 1865-1944, artist
,
Berry, Paul, 1950- writer of supplementary textual content
in
Fukuda, Haritsu, 1865-1944 Exhibitions.
,
Fukuda, Haritsu, 1865-1944 Catalogs.
,
Fukuda, Haritsu, 1865-1944 Criticism and interpretation.
2023
\"The most comprehensive book on Kodojin's art ever published--beautiful and mysterious--a collection of more than 100 paintings with English translations of the inscribed poems.The Art and Life of Fukuda Kodōjin is the first publication in English to offer an in-depth examination of Kodōjin's life, painting, and poetry. This fully illustrated publication draws from institutions and private collections worldwide, and is the result of fifteen years of extensive research into almost eight hundred works of inscribed poetry, literati landscapes, brush paintings and calligraphy. A beautiful and contemplative look into the world of Kodōjin, this coveted edition accompanies a special exhibition held at the Minneapolis Institute of Art.Fukuda Kodōjin (1865-1944) was a multifaceted artist, recognized for his poetry, painting and calligraphy, and is one of a handful of artists who continued the tradition of Japanese literati painting (nanga) into the twentieth century. Kodōjin's painting style is characterized by bizarrely shaped mountain forms rendered in vivid color or monochromatic ink, often with a solitary scholar enjoying the expansive beauty of nature and bits of inscribed poetry. Creating over 700 works in his lifetime, he also made simple paintings of plants and flowers in his dramatic brushwork, and distinctive literati landscapes.Kodōjin literally means 'Old Taoist' which seems to reflect the path he chose of resilience of an old tradition facing new conditions and new challenges, and is theme felt throughout his art. There is both beauty and mystery in his life and work, and his landscapes can be rich in costly green and blue pigments, detailed layers of ink shading and strokes, or purely abstract.Unique, mysterious and distinctively expressive, The Art and Life of Fukuda Kodojin offers an unprecedented walk through the Old Taoist's mind, sure to both surprise and enlighten the curious reader, scholar, or literati enthusiast.\"-- Provided by publisher.
IL/I-Labeling Halin Graphs with Maximum Degree Eight
2022
Suppose that T is a plane tree without vertices of degree 2 and with at least one vertex of at least degree 3, and C is the cycle obtained by connecting the leaves of T in a cyclic order. Set G=T∪C, which is called a Halin graph. A k-L(2,1)-labeling of a graph G=(V,E) is a mapping f:V(G)→0,1,...,k such that, for any x[sub.1],x[sub.2]∈V(G), it holds that |f(x[sub.1])−f(x[sub.2])|≥2 if x[sub.1]x[sub.2]∈E(G), and |f(x[sub.1])−f(x[sub.2])|≥1 if the distance between x[sub.1] and x[sub.2] is 2 in G. The L(2,1)-labeling number, denoted λ(G), of G is the least k for which G is k-L(2,1)-labelable. In this paper, we prove that every Halin graph G with Δ=8 has λ(G)≤10. This improves a known result, which states that every Halin graph G with Δ≥9 satisfies λ(G)≤Δ+2. This result, together with some known results, shows that every Halin graph G satisfies λ(G)≤Δ+6.
Journal Article
Ultrasensitive Materials for Electrochemical Biosensor Labels
by
Koyappayil, Aneesh
,
Lee, Min-Ho
in
Biosensing Techniques
,
Electrochemical Techniques
,
enzyme labels
2020
Since the fabrication of the first electrochemical biosensor by Leland C. Clark in 1956, various labeled and label-free sensors have been reported for the detection of biomolecules. Labels such as nanoparticles, enzymes, Quantum dots, redox-active molecules, low dimensional carbon materials, etc. have been employed for the detection of biomolecules. Because of the absence of cross-reaction and highly selective detection, labeled biosensors are advantageous and preferred over label-free biosensors. The biosensors with labels depend mainly on optical, magnetic, electrical, and mechanical principles. Labels combined with electrochemical techniques resulted in the selective and sensitive determination of biomolecules. The present review focuses on categorizing the advancement and advantages of different labeling methods applied simultaneously with the electrochemical techniques in the past few decades.
Journal Article