Antimagic Labeling of Generalized Edge Corona Graphs

An antimagic labeling of a graph $G$ is a one-to-one correspondence between the edge set $E(G)$ and $\lbrace 1,2,...,|E(G)|\rbrace$ in which the sum of the edge labels incident on the distinct vertices are distinct. Let $G$,$H_1$,$H_2$,...,$H_{m-1}$, and $H_m$ be simple graphs where $|E(G)|=m$. A generalized edge corona of the graph $G$ and $(H_1,H_2,...,H_m)$ (denoted by $G\diamond (H_1,H_2,...H_m)$) is a graph obtained by taking a copy of $G,H_1,H_2,...,H_m$ and joining the end vertices of $i^{th}$ edge of $G$ to every vertex of $H_i$, $i\in\lbrace 1,2,...,m\rbrace$. In this paper, we consider $G$ as a connected graph with exactly one vertex of maximum degree 3 (excluding the spider graph with exactly one vertex of maximum degree 3 containing uneven legs) and each $H_i$, $1\leq i \leq m$ as a connected graph on at least two vertices. We provide an algorithmic approach to prove that $G$ $\diamond$ $(H_1,H_2,...H_m)$ is antimagic under certain conditions

A MANUAL INSERTION FACET FOR UNCERTANITY FROM THEIR FETCH RESULTS

The aggregating frequent lists inside the top internet search engine results in mine query facets and implement a method known as QDMiner. More particularly, QDMiner extracts lists totally free text, HTML tags, and repeat regions within the top internet search engine results, groups them into clusters when using the products they contain, then ranks the clusters and products for a way the lists and products can be found in the very best results. Our suggested approach is generic and doesn't depend on any type of domain understanding. The primary reason behind mining facets differs from query recommendation. We advise an organized solution, which we call QDMiner, to right away mine query facets by removing and grouping frequent lists totally free text, HTML tags, and repeat regions within top internetsearch engine results. We further look at the issue of list duplication, and uncover better query facets may be discovered by modeling fine-grained similarities between lists and penalizing the duplicated lists. Experimental results show many lists are available and helpful query facets may be discovered by QDMiner. Our recommended approach is generic and doesn't depend on any kind of domain understanding. In order that it can cope with open-domain queries. Query dependent. rather in the fixed schema for the concerns, we extract facets inside the top retrieved documents for every query

CURATION AND MANAGEMENT OF CULTURAL HERITAGE THROUGH LIBRARIES

Libraries, museums and archives hold valuable collections in a variety of media, presenting a vast body of knowledge rooted in the history of human civilisation. These form the repository of the wisdom of great works by thinkers of past and the present. The holdings of these institutions are priceless heritage of the mankind as they preserve documents, ideas, and the oral and written records. To value the cultural heritage and to care for it as a treasure bequeathed to us by our ancestors is the major responsibility of libraries. The past records constitute a natural resource and are indispensable to the present generation as well as to the generations to come. Libraries preserve the documentary heritage resources for which they are primarily responsible. Any loss of such materials is simply irreplaceable. Therefore, preserving this intellectual, cultural heritage becomes not only the academic commitment but also the moral responsibility of the librarians/information scientists, who are in charge of these repositories. The high quality of the papers and the discussion represent the thinking and experience of experts in their particular fields. The contributed papers also relate to the methodology used in libraries in Asia to provide access to manuscripts and cultural heritage. The volume discusses best practices in Knowledge preservation and how to collaborate and preserve the culture. The book also deals with manuscript and archives issues in the digital era. The approach of this book is concise, comprehensively, covering all major aspects of preservation and conservation through libraries. The readership of the book is not just limited to library and information science professionals, but also for those involved in conservation, preservation, restoration or other related disciplines. The book will be useful for librarians, archivists and conservators. We thank the Sunan Kalijaga University, Special Libraries Association- Asian Chapter for their trust and their constant support, all the contributors for their submissions, the members of the Local and International Committee for their reviewing effort for making this publication possible

One-Three Join: A Graph Operation and Its Consequences

In this paper, we introduce a graph operation, namely one-three join. We show that the graph G admits a one-three join if and only if either G is one of the basic graphs (bipartite, complement of bipartite, split graph) or G admits a constrained homogeneous set or a bipartite-join or a join. Next, we define ℳH as the class of all graphs generated from the induced subgraphs of an odd hole-free graph H that contains an odd anti-hole as an induced subgraph by using one-three join and co-join recursively and show that the maximum independent set problem, the maximum clique problem, the minimum coloring problem, and the minimum clique cover problem can be solved efficiently for ℳH

A structural approach to the graceful coloring of a subclass of trees

Let M={1,2,..m} and G be a simple graph. A graceful m-coloring of G is a proper vertex coloring of G using the colors in M which leads to a proper edge coloring using M∖{m} colors such that the associated color of each edge is the absolute difference between their end vertices. The graceful chromatic number χg(G)= min {m:G admits a gracefulm− coloring }. We prove that 5≤χg(T)≤7, where T is a tree with Δ=4. Furthermore, we categorize the trees into three types along with its characterization and the related coloring algorithm are presented in this study

One-Three Join: A Graph Operation and Its Consequences

In this paper, we introduce a graph operation, namely one-three join. We show that the graph G admits a one-three join if and only if either G is one of the basic graphs (bipartite, complement of bipartite, split graph) or G admits a constrained homogeneous set or a bipartite-join or a join. Next, we define ℳH as the class of all graphs generated from the induced subgraphs of an odd hole-free graph H that contains an odd anti-hole as an induced subgraph by using one-three join and co-join recursively and show that the maximum independent set problem, the maximum clique problem, the minimum coloring problem, and the minimum clique cover problem can be solved efficiently for ℳH

One-three join: A graph operation and its consequences

In this paper, we introduce a graph operation, namely one-three join. We show that the graph G admits a one-three join if and only if either G is one of the basic graphs (bipartite, complement of bipartite, split graph) or G admits a constrained homogeneous set or a bipartite-join or a join. Next, we define ℳH as the class of all graphs generated from the induced subgraphs of an odd hole-free graph H that contains an odd anti-hole as an induced subgraph by using one-three join and co-join recursively and show that the maximum independent set problem, the maximum clique problem, the minimum coloring problem, and the minimum clique cover problem can be solved efficiently for ℳH

Bio prospecting of Aloe barbadensis miller (Aloe vera) for silver nanoparticles against breast cancer: A review

Silver nanoparticles (AgNPs) are gaining substantial importance in the fields of biotechnology and medicine. Its composites are metal oxides, silicates, polymers, graphene, fibers, dendrimers, etc. The greenly synthesized AgNPs possess advantages over conventional AgNPs in the form of fewer chemical reagents and a low temperature and pressure for synthesis. The anticancer efficacy of AgNPs is attributed to a number of variables, including size, shape, surface-to-volume ratio, etc. There are several ways to make SNPs, but the green synthesis of AgNPs, which uses harmless chemicals and natural reagents, has gained significant interest and value. In this review, a comprehensive range of topics related to silver nanoparticles, the environmentally friendly method of producing them from plants such as Aloe barbadensis miller (aloe vera), which have a vast medicinal uses, and their anticancer effectiveness against breast cancer cells are discussed. The synthesized AgNPs are characterized via a range of methods, for instance, Fourier Transform Infrared Spectroscopy (FTIR), UV–visible spectroscopy, Transmission Electron Microscopy (TEM), Scanning Electron Microscopy (SEM), Atomic Force Microscopy (AFM), and X-ray Diffraction (XRD). This review study includes an investigation into the stability of produced nanoparticles, the wide range of nanoparticle forms, the many techniques used in the conglomeration of nanoparticles, and comparison methods emphasizing the benefits of green synthesis relative to traditional techniques. Furthermore, the discussion explores the chemical and structural makeup of nanoparticles