Despite the partial disclosure of driving scenario knowledge graphs, they still fail to meet the comprehensive needs of intelligent connected vehicles for driving knowledge. Current issues include the high complexity of pattern layer construction, insufficient accuracy of information extraction and fusion, and limited performance of knowledge reasoning models. To address these challenges, a hybrid knowledge graph method was adopted in the construction of the Driving Scenario Knowledge Graph (DSKG). Firstly, core concepts in the field were systematically sorted and classified, laying the foundation for the construction of a multi-level classified knowledge graph top-level ontology. Subsequently, by deeply exploring and analyzing the Traffic Genome data, 34 entities and 51 relations were extracted and integrated with the ontology layer, achieving the expansion and updating of the knowledge graph. Then, in terms of knowledge reasoning models, an analysis of the training results of the TransE, Complex, Distmult, and Rotate models in the entity linking prediction task of DSKG revealed that the Distmult model performed the best in metrics such as hit rate, making it more suitable for inference in DSKG. Finally, a standardized and widely applicable Driving Scenario Knowledge Graph was proposed. The DSKG and related materials have been publicly released for use by industry and academia.

New notion of dimension as set, as two optimal numbers including metric number, dimension number and as optimal set are introduced in individual framework and in formation of family. Behaviors of twin and antipodal are explored in fuzzy(neutrosophic) graphs. Fuzzy(neutrosophic) graphs, under conditions, fixed-edges, fixed-vertex and strong fixed-vertex are studied. Some classes as path, cycle, complete, strong, t-partite, bipartite, star and wheel in the formation of individual case and in the case, they form a family are studied in the term of dimension. Fuzzification(neutrosofication) of twin vertices but using crisp concept of antipodal vertices are another approaches of this study. Thus defining two notions concerning vertices which one of them is fuzzy(neutrosophic) titled twin and another is crisp titled antipodal to study the behaviors of cycles which are partitioned into even and odd, are concluded. Classes of cycles according to antipodal vertices are divided into two classes as even and odd. Parity of the number of edges in cycle causes to have two subsections under the section is entitled to antipodal vertices. In this study, the term dimension is introduced on fuzzy(neutrosophic) graphs. The locations of objects by a set of some junctions which have distinct distance from any couple of objects out of the set, are determined. Thus it’s possible to have the locations of objects outside of this set by assigning partial number to any objects. The classes of these specific graphs are chosen to obtain some results based on dimension. The types of crisp notions and fuzzy(neutrosophic) notions are used to make sense about the material of this study and the outline of this study uses some new notions which are crisp and fuzzy(neutrosophic). Some questions and problems are posed concerning ways to do further studies on this topic. Basic familiarities with fuzzy(neutrosophic) graph theory and graph theory are proposed for this article.

This study introduces a novel computational approach for testing conditional independence (BB CI test) within causal Directed Acyclic Graphs (DAGs), leveraging Bayesian non-parametric bootstrap and machine learning techniques. Our method offers an alternative for validating the assumptions underpinning causal DAGs. Through simulation studies and an industrial case analysis, we demonstrate the test procedure in accurately assessing conditional independence, comparing it with the Generalized Covariance Measure (GCM) test. Our findings suggest that the BB CI test is advantageous in scenarios where existing methods may falter due to violations of model assumptions. This research contributes to the causal inference literature by providing a computational tool for researchers and practitioners to validate causal models.

In this paper, we observe that if X is a set and (Bin(X), □) is the semigroup of binary systems on X, then its center ZBin(X) consists of the locally-zero-semigroups and that these can be modeled as (simple) graphs and conversely. Using this device we show that we may obtain many results of interest concerning groupoids by reinterpreting graph theoretical properties and at the same time results on graphs G may be obtained by considering them as elements of centers of the semigroups of binary systems (Bin(X), □) where X = V(G), the vertex set of G.

Many protein expression systems are primary utilised to produce a single, specific recombinant protein. In contrast, most biological processes such as virus assembly rely upon a complex of several interacting proteins rather than the activity of a sole protein. The high complexity of the baculovirus genome, coupled with a multiphase replication cycle incorporating distinct transcriptional steps, made it the ideal system to manipulate for high-level expression of a single or co-expression of multiple foreign proteins within a single cell. We have developed and utilised a series of recombinant baculovirus systems to unravel the sequential assembly process of a complex non-enveloped model virus, Bluetongue virus (BTV). The high protein yields expressed by the baculovirus system not only facilitated structure-function analysis of each viral proteins but were also advantageous to crystallography studies and supported the first atomic level resolution of a recombinant viral protein, the major BTV capsid protein. Further, the formation of recombinant double-shelled virus-like particles (VLPs) provided insights into the structure-function relationships among the four major structural proteins of the BTV whilst also representing a potential candidate for a viral vaccine. The baculovirus multi-gene expression system facilitated the study of structurally complex viruses (both non-enveloped and enveloped viruses) and heralded in a new generation of viral vaccines.

Hepatitis E virus (HEV) is a common cause of acute hepatitis worldwide, accounting for approximately 25% of deaths among pregnant women. We previously reported that pregnancy serum facilitates HEV replication in vitro. However, the differences in host cells with HEV infection induced by pregnancy serum and fetal bovine serum (FBS) are unclear. In this study, differentially expressed proteins were identified in HEV-infected hepatoma cells (HepG2) supplemented with different sera by using isobaric tags for relative and absolute quantitation. Proteomic analysis indicated that HEV infection significantly induced 1014 differentially expressed proteins in HEV-infected HepG2 cells when supplemented with FBS compared with pregnancy serum. Further validation by Western blot confirmed that filamin A, heat-shock proteins 70 and 90, Cytochrome c, and Thioredoxin were associated with HEV infection. This comparative analysis provides an important basis to further investigate HEV pathogenesis in pregnant women and HEV replication.

In this article, some kinds of triple belongs to metric dimensions are defined. Some classes of graphs in the matter of these kinds, are studied and the relation amid these kinds are considered. The kind of having equivalency amid these notions and some classes of graphs, is obtained. The kind of locating some vertices by some vertices when the number of locating vertices is increased, has the key role to analyze the classes of graphs, general graphs, and graph's parameters.

We address the problem of finding a unique graph embedding that best describes a graph's "topology". This issue is of particular interest in the chemistry of materials. Graphs that admit a tiling in 3-dimensional Euclidean space are termed tessellate, those that do not decussate. We give examples of decussate and tessellate graphs that are finite and 3-periodic. We conjecture that a graph has at most one tessellate embedding. We give reasons for considering this the default "topology" of periodic graphs.

Being able to express broad families of equivariant or invariant attributed graph functions is a popular measuring stick of whether graph neural networks should be employed in practical applications. However, it is equally important to learn deep local minima of losses (i.e., with much smaller loss values than other minima), even when architectures cannot express global minima. In this work we introduce the architectural property of attracting GNN optimization trajectories to local minima as a means of achieving smaller losses. We take first steps in satisfying this property for losses defined over attributed undirected unweighted graphs with a novel architecture, called Universal Local Attractor (ULA). The latter refines each dimension of end-to-end trained node feature embeddings based on graph structure to track the optimization trajectories of losses satisfying some mild conditions. The refined dimensions are then linearly pooled to create predictions. We experiment on 10 tasks, from node classification to clique detection, on which ULA is comparable with or significantly outperforms popular alternatives of similar or greater theoretical expressive power.

Symmetry, as a key concept in geometry and the foundational principle of mathematical concepts, is a fundamental part of geometry and nature, creating patterns that help us conceptually organize our world. It is often linked with aesthetic beauty and can be observed in both natural phenomena and human-made objects, such as artworks and manufactured products, across the globe. The automorphism group of a graph is a mathematical structure that captures all the symmetries of the graph. symmetry refers to the property of a graph, indicating that it can be transformed without changing its structure, while the automorphism group is the collection of all permutations of the vertices that preserve the graph's adjacency relationships. In graph theory, the concepts of symmetry group and automorphism group play fundamental roles in understanding the symmetries and structural properties of graphs. This paper aims to explore the relationship between symmetry groups and automorphism groups, shedding light on their interconnected nature and their significance in graph theory. We delve into the definitions and properties of both symmetry groups and automorphism groups, highlighting their similarities and distinctions. Furthermore, we discuss their applications in various fields, including computer science, chemistry, and network analysis. Through this exploration, we aim to provide a comprehensive understanding of the relationship between symmetry groups and automorphism groups, deepening our comprehension of the symmetries and structures inherent in graphs.

Shannon entropy quantifying bi-colored Ramsey complete graphs is introduced. Complete graphs in which vertices are connected with two types of links, labeled as α-links and β-links are considered. Shannon-entropy is introduced according to the classical Shannon formula considering the fractions of monochromatic convex α-colored polygons with n α-sides or edges, and the fraction of monochromatic β-colored convex polygons with m β-sides in the given complete graph. Introduced Shannon entropy is insensitive to the exact shape of the graph, but it is sensitive to the distribution of monochromatic polygons in a given graph. The introduced Shannon Entropies Sα and Sβ are interpreted as follows: Sα is interpreted as an average uncertainty to find the green α-polygon in the given graph, Sβ is, in turn, an average uncertainty to find the red β-polygon in the same graph. The re-shaping of the Ramsey theorem in terms of the Shannon Entropy is suggested. Various measures quantifying the Shannon Entropy of the entire complete bi-colored graphs are suggested. Physical interpretations of the suggested Shannon Entropies are discussed.

New setting is introduced to study neutrosophic failed-independent number and failed independent neutrosophic-number arising neighborhood of different vertices. Neighbor is a key term to have these notions. Having all possible edges amid vertices in a set is a key type of approach to have these notions namely neutrosophic failed-independent number and failed independent neutrosophic-number. Two numbers are obtained but now both settings leads to approach is on demand which is finding biggest set which have all vertices which are neighbors. Let NTG : (V,E,σ,μ) be a neutrosophic graph. Then failed independent number I(NTG) for a neutrosophic graph NTG : (V,E,σ,μ) is maximum cardinality of a set S of vertices such that every two vertices of S are endpoints for an edge, simultaneously; failed independent neutrosophic-number In(NTG) for a neutrosophic graph NTG : (V,E,σ,μ) is maximum neutrosophic cardinality of a set S of vertices such that every two vertices of S are endpoints for an edge, simultaneously. As concluding results, there are some statements, remarks, examples and clarifications about some classes of neutrosophic graphs namely path-neutrosophic graphs, cycle-neutrosophic graphs, complete-neutrosophic graphs, star-neutrosophic graphs, complete-bipartite-neutrosophic graphs and complete-t-partite-neutrosophic graphs. The clarifications are also presented in both sections “Setting of Neutrosophic Failed-Independent Number,” and “Setting of Failed Independent Neutrosophic-Number,” for introduced results and used classes. Neutrosophic number is reused in this way. It’s applied to use the type of neutrosophic number in the way that, three values of a vertex are used and they’ve same share to construct this number to compare with other vertices. Summation of three values of vertex makes one number and applying it to a comparison. This approach facilitates identifying vertices which form neutrosophic failed-independent number and failed independent neutrosophic-number arising neighborhoods of vertices. In path-neutrosophic graphs, two neighbors, form maximal set but with slightly differences, in cycle-neutrosophic graphs, two neighbors forms maximal set. Other classes have same approaches. In complete-neutrosophic graphs, a set of all vertices leads us to neutrosophic failed-independent number and failed independent neutrosophic-number. In star-neutrosophic graphs, a set of vertices containing only center and one other vertex, makes maximal set. In complete-bipartite-neutrosophic graphs, a set of vertices including two vertices from different parts makes intended set but with slightly differences, in complete-t-partite-neutrosophic graphs, a set of t vertices from different parts makes intended set. In both settings, some classes of well-known neutrosophic graphs are studied. Some clarifications for each result and each definition are provided. Using basic set to extend this set to set of all vertices has key role to have these notions in the form of neutrosophic failed-independent number and failed independent neutrosophic-number arising neighborhood of vertices. The cardinality of a set has eligibility to neutrosophic failed-independent number but the neutrosophic cardinality of a set has eligibility to call failed independent neutrosophic-number. Some results get more frameworks and perspective about these definitions. The way in that, two vertices have connections amid each other, opens the way to do some approaches. A vertex could affect on other vertex but there’s no usage of edges. These notions are applied into neutrosophic graphs as individuals but not family of them as drawbacks for these notions. Finding special neutrosophic graphs which are well-known, is an open way to pursue this study. Some problems are proposed to pursue this study. Basic familiarities with graph theory and neutrosophic graph theory are proposed for this article.

New setting is introduced to study quasi-degree and quasi-co-degree arising from co-neighborhood. quasi-degree and quasi-co-degree is about a vertex which are applied into the setting of neutrosophic graphs. . The structure of set is studied and general results are obtained. Also, some classes of neutrosophic graphs namely path-neutrosophic graphs, cycle-neutrosophic graphs, complete-neutrosophic graphs and star-neutrosophic graphs, complete-bipartite-neutrosophic graphs and complete-multipartite-neutrosophic graphs are investigated in the terms of a vertex which is called either quasi-degree or quasi-co-degree. Neutrosophic number is reused in this way. It’s applied to use the type of neutrosophic number in the way that, three values of a vertex are used and they’ve same share to construct this number to compare with other vertices. Summation of three values of vertex makes one number and applying it to a comparison. This approach facilitates identifying vertices which form quasi-degree and quasi-co-degree. Quasi-degree is a value of a vertex which is maximum amid all values of vertices which are neighbors to a fixed vertex. Quasi-co-degree is a value of an edge which is maximum amid all values of edges which are neighbors to a fixed vertex but corresponded vertex is representative for this notion. Using different values which are related to a vertex inspire us to focus on edge and vertices which are corresponded to a fixed vertex. The notion of neighborhood is used to collect either vertices are titled neighbors or edges are incident to fixed vertex. In both settings, some classes of well-known neutrosophic graphs are studied. Some clarifications for each result and each definitions are provided. Using fixed vertex has key role to have these notions in the form of vertex or edge. The value of an edge has eligibility to call quasi-co-degree but the value of a vertex has eligibility to call quasi-degree. Some results get more frameworks and perspective about these definitions. The way in that, two vertices have connection together, open the way to define neighborhood and co-neighborhood. The maximum values in neighborhood and co-neighborhood introduces quasi-degree and quasi-co-degree, respectively. New name is chosen from degree. Since amid all vertices with different degrees, one vertex is chosen. In other words, one vertex is fixed and its degree turns out quasi-degree where two degrees could be assigned to a vertex. Degree of edges and degree of vertices. The number of edges which are incident to the vertex and the number of vertices which are neighbors to the vertex. Degree and co-degree are the notions which are transformed to use in quasi-style. Two neutrosophic values introduce two neutrosophic vertices separately in each settings. These notions are applied into neutrosophic graphs as individuals but not family of them as drawbacks for these notions. Finding special neutrosophic graphs which are well-known, is an open way to purse this study. Some problems are proposed to pursue this study. Basic familiarities with graph theory and neutrosophic graph theory are proposed for this article.

The aim of this expository article is to present recent developments in the centuries-old discussion on the interrelations between several types of domination in graphs. However, the novelty even more prominent in the newly discovered simplified presentations of several older results. Domination can be seen as arising from real-world application and extracting classical results as first described by this article.The main part of this article, concerning a new domination and older one, is presented in a narrative that answers two classical questions: (i) To what extend must closing set be dominating? (ii) How strong is the assumption of domination of a closing set? In a addition, we give an overview of the results concerning domination. The problem asks how small can a subset of vertices be and contain no edges or, more generally how can small a subset of vertices be and contain other ones. Our work was as elegant as it was unexpected being a departure from the tried and true methods of this theory that had dominated the field for one fifth a century. This expository article covers all previous definitions. The inability of previous definitions in solving even one case of real-world problems due to the lack of simultaneous attentions to the worthy both of vertices and edges causing us to make the new one. The concept of domination in a variety of graphs models such as crisp, weighted and fuzzy, has been in a spotlight. We turn our attention to sets of vertices in a fuzzy graph that are so close to all vertices, in a variety of ways, and study minimum such sets and their cardinality. A natural way to introduce and motivate our subject is to view it as a real-world problem. In its most elementary form, we consider the problem of reducing waste of time in transport planning. Our goal here is to first describe the previous definitions and the results, and then to provide an overview of the flows ideas in their articles. The final outcome of this article is twofold: (i) Solving the problem of reducing waste of time in transport planning at static state; (ii) Solving and having a gentle discussions on problem of reducing waste of time in transport planning at dynamic state. Finally, we discuss the results concerning holding domination that are independent of fuzzy graphs. We close with a list of currently open problems related to this subject. Most of our exposition assumes only familiarity with basic linear algebra, polynomials, fuzzy graph theory and graph theory.

We introduce a new variation on the domination theme which we call vertex domination as reducing waste of time in transportation planning and optimization of transport routes. We determine the vertex domination number $\gamma_v$ for several classes of fuzzy graphs. The bounds is obtained for it. In fuzzy graphs, monotone decreasing property and monotone increasing property are introduced. We prove both of the vizing's conjecture and the Grarier-Khelladi's conjecture are monotone decreasing fuzzy graph property for vertex domination. We obtain Nordhaus-Gaddum (NG) type results for these parameters. The relationship between several classes of operations on fuzzy graphs with the vertex domination number of them is studied. Finally, we discuss about vertex dominating set of a fuzzy tree by using the bridges and $\alpha$-strong edges equivalence.

Many various using of this new-born fuzzy model for solving real-world problems and urgent requirements involve introducing new concept for analyzing the situations which leads to solve them by proper, quick and ecient method based on statistical data. This gap between the model and its solution cause that we introduce nikfar domination in neutrosophic graphs as creative and eective tool for studying a few selective vertices of this model instead of all ones by using special edges. Being special selection of these edges aect to achieve quick and proper solution to these problems. Domination hasn't ever been introduced. So we don't have any comparison with another de nitions. The most used graphs which have properties of being complete, empty, bipartite, tree and like stu and they also achieve the names for themselves, are studied as fuzzy models for getting nikfar dominating set or at least becoming so close to it. We also get the relations between this special edge which plays main role in doing dominating with other special types of edges of graph like bridges. Finally, the relation between this number with other special numbers and characteristic of graph like order are discussed.

A popular approach to learning about admixture from population genetic data is by computing the allele-sharing summary statistics known as f-statistics. Compared to some methods in population genetics, f-statistics are relatively simple, but interpreting them can still be complicated at times. In addition, f-statistics can be used to build admixture graphs (multi-population trees allowing for admixture events), which provide more explicit and thorough modeling capabilities but are correspondingly more complex to work with. Here, I discuss some of these issues to provide users of these tools with a basic guide for protocols and procedures. My focus is on the kinds of conclusions that can or cannot be drawn from the results of f₄-statistics and admixture graphs, illustrated with real-world examples involving human populations.

This review highlights the potential and limitations of mRNA vaccines with a particular focus on mucosal delivery as an alternative to parenteral administration. The strengths of mRNA vaccines are: a) Versatility: they can be adapted to target a wide range of pathogens; b) Faster development: designed and produced more quickly than traditional vaccines; c) High efficacy: effective in preventing severe disease, as demonstrated during the COVID-19 pandemic. Current challenges: a) Delivery: current methods (mainly intramuscular injection) may not be optimal for inducing mucosal immunity; b) Stability: mRNA is fragile and needs to be protected from degradation; c) Safety: potential side effects, including myocarditis, blood clotting, allergic reactions need further investigation. Mucosal delivery could be more effective in preventing the transmission of pathogens and is generally better accepted by the population. Pros: offers the potential to induce local immunity at the site of pathogen entry, potentially providing broader protection; Cons: developing effective delivery systems and adjuvants for mucosal delivery is difficult. Extracellular vesicles as a mucosal delivery system are promising and offer a potentially safe, scalable, and needle-free approach. Future directions: a) Optimizing mRNA constructs: strategies like codon optimization and self-amplifying RNA can improve stability and translation efficiency; b) Rigorous pre-clinical studies are essential before human trials.

Background: RSV, or respiratory syncytial virus, is a deadly condition that is present all over the world today. The infection is initially contained in the lower respiratory tract without systemic transmission. The objective of the study: Bioinformatics was used in Egypt to create an mRNA vaccine against the Respiratory syncytial virus (RSV). Methodology: In the present screening experimental study, a lipid nanoparticles vaccine of mRNA of the surface fusion protein of Respiratory syncytial virus was manufactured. The present vaccine delivery system was lipid nanoparticles with a particle size of approximately 90 nanometres, manufactured by the hot micro-emulsion method. In stages 1 and 2 of clinical trials, the immunogenicity of the current mRNA RSV vaccine was evaluated. Results: The current vaccine demonstrated 81% immunogenicity in animal testing, but only 69% in stages 1 and 2 of clinical trials. Its side effects were manageable. The results persisted for a while. In the current trial, the vaccination proved effective as a preventative measure against RSV infection. The current vaccination lacked antibody-dependent enhancement, which causes non-protective antibodies to develop. These non-neutralizing antibodies exacerbate infection by activating cytokines and complement cascade through the formation of immune complexes or enhancement of the virus entry and replication in the host cells. On the other hand, the current RSV mRNA vaccine of the surface fusion protein consequent on the production of powerful neutralizing antibodies with prolonged immunity especially to infants and elderly candidates who received the optimal dosage regimen.

Background: Respiratory syncytial virus[ RSV] is a lethal overwhelming defectiveness that influences people all over the world. The infection gets down in the lower respiratory tract and does not disperse to the remainder of the body. The objective of the study: Bioinformatics was used to create an mRNA vaccine against the Respiratory syncytial virus( RSV). Methodology: Lipid nanoparticle vaccines containing the Respiratory syncytial virus's surface fusion protein's mRNA were created for the current screening experimental investigation. Lipid nanoparticles[ LNP] with a particle size of around 90 nanometres that were created using the hot micro-emulsion process comprise the current vaccine delivery system. In stages 1 and 2 of clinical trials, the immunogenicity of the current mRNA RSV vaccine was evaluated. Results: The current vaccine demonstrated 81% immunogenicity in animal testing, but only 69% in stages 1 and 2 of clinical trials. Its side effects were manageable. The results persisted for a while. In the current trial, the vaccination proved effective as a preventative measure against RSV infection. The current immunization lacks antibody-dependent enhancement, which causes non-protective antibodies to develop. These non-neutralizing antibodies worsen infection by enhancing viral entrance and replication in the host cells, activating cytokines and the complement cascade through the production of immunological complexes, or both. However, the current LPN-RSV mRNA vaccine of the surface fusion protein resulted in the formation of potent neutralizing antibodies with persistent protection, especially for newborns and elderly individuals who get the ideal dose regimen. Conclusion: The invention of the LNP-mRNA RSV vaccine, which might prevent RSV-caused bronchiolitis and fatal pneumonia, made the current study promising

With the rapid evolution of SARS-CoV-2, the emergence of new strains is an intriguing question. This paper presents an evolutionary theory to analyze the mutations of the virus and identify the conditions that lead to the generation of new strains. We represent the virus variants using a 4-letter sequence based on amino acid mutations on the spike protein and employ an n-distance algorithm to derive a variant phylogenetic tree. We show that the theoretically-derived tree aligns with experimental data on virus evolution. Additionally, we propose an A-X model, utilizing the set of existing mutation sites (A) and a set of randomly generated sites (X), to calculate the emergence of new strains. Our findings demonstrate that a sufficient number of random iterations can predict the generation of new macro-lineages when the number of sites in X is large enough. These results provide a crucial theoretical basis for understanding the evolution of SARS-CoV-2.

The study on graphs emerging from different algebraic structures like groups, rings, fields, vector spaces, etc. is a prominent area of research in mathematics, as algebra and graph theory are two mathematical fields that focuses on creating and analysing structures. There are numerous studies linking algebraic structures and graphs, which began with the introduction of Cayley graphs of groups. Several algebraic graphs have been defined on rings, which have huge-growing literature. In this article, we systematically review the literature on some variants of Cayley graphs that are defined on rings, to understand the research in this area.

In IP networks, packet forwarding is destination-based and hop-by-hop, and routes are built as needed. Kwong et al. introduced a protection routing in which packet delivery to the destination node can proceed uninterrupted in the event of any single node or link failure. He then shows that “whether there is a protection routing to the destination” is NP-complete. Tapolcai find that two completely independent spanning trees, abbreviated as CISTs, can be used to configure the protection routing. In this paper, we propose dual protection routing trees, denoted as dual-PRTs to replace CISTs, which are less restrictive than CISTs. Next, we propose a transformation algorithm that uses dual-PRTs to configure the protection routing. Taking complete graphs Kn, complete bipartite graphs Km,n, hypercubes Qn, locally twisted cubes LTQn as examples, we provide a recursive method to construct dual-PRTs on them. This article will show that there are no two CISTs on K3,3, Q3, and LTQ3, but there exist dual-PRTs that can be used to configure the protection routing. As shown in the performance evaluation of simulation results, for both Qn and LTQn, we get the average path length of protection routing configured by dual-PRTs is shorter than that by two CISTs.

Graph entropies have been used to interpret the complexity of the networks. There are various graph entropies in the literature. In this note a new graph entropy is defined which is based on the dominating sets of the graphs. Moreover the entropy of some classes of the graphs is obtained

The canonical decomposition of a bipartite graph is a new decompositionmethod that involves three operators, parallel, series and K+S. The class of weak bisblit graphs is totally decomposable with respect of these operators, and the class of bicographs is totally decomposable with respect of parallel and series operators. We prove in this paper that the class of bipartite (P_6,C_6)-free graphs is exactly the class of bipartite graphs that are totally decomposable with respect of parallel and K+S operators. We simplify the recognition algorithm of weak-bisplit graphs to adepte with bipartite (P_6,C_6)-free graphs. As a result of this adapted algorithm, we prsent efficient solutions in this class of graphs for two optimization graph problems, the first is the maximm balanced bi-clique problem and the the second is the maximum independent set problem.

Let G[F,Vk, Huv] be the graph with k pockets, where F is a simple graph of order n ≥ 1,Vk= {v1,v2,··· ,vk} is a subset of the vertex set of F and Hvis a simple graph of order m ≥ 2,v is a specified vertex of Hv. Also let G[F,Ek, Huv] be the graph with k edge pockets, where F is a simple graph of order n ≥ 2, Ek= {e1,e2,···ek} is a subset of the edge set of F and Huvis a simple graph of order m ≥ 3, uv is a specified edge of Huvsuch that Huv− u is isomorphic to Huv− v. In this paper, we derive closed-form formulas for resistance distance and Kirchhoff index of G[F,Vk, Hv] and G[F,Ek, Huv] in terms of the resistance distance and Kirchhoff index F, Hv and F, Huv, respectively.

In March 2013, a novel avian influenza A H7N9 virus was emerged in China, which cause rapidly progressive pneumonia and with a high fatality rate. Serologic studies to evaluate neutralizing antibodies of infected patients and birds are invaluable tools for immunogenicity research of H7N9 and epidemiological investigation. Conventional neutralization assays are laborious and time-consuming which also hampered by biosafety requirement. In this study, We construct and produce pseudovirus bearing the full-length hemagglutinin (HA) of H7N9 virus in the Env-defective, luciferase-expressing HIV-1 backbone. The production of lentiviral pseudovirus was analysed by HA gene specific real-time reverse-transcription PCR, transmission electron microscopy (TEM), and Western Blot assay to prove the nucleic acid replication, the morphology of virus, and the expression of HA protein in pseudovirus. After that pseudovirus based inhibition assay was established to detect neutralizing antibodies of a panel of serum samples. Our results demonstrated that H7N9 pseudovirus which had single-cycle infection was generated. By comparing the neutralization antibody titers, pseudovirus based neutralization test could be recognized as an alternative of conventional microneutralization (MN). Hence, we conclude that it is possible to use pseudovirus inhibition assay to screen sera samples, as well as evaluate vaccine-induced neutralizing antibodies against H7N9 virus.

The domestic ducks (Anas platyrhynchos domesticus) are resistant to most of the highly pathogenic avian influenza virus (HPAIV) infections. In this study, we characterized the lung proteome and phosphoproteome of ducks infected with HPAI H5N1 virus (A/duck/India/02CA10/2011/Agartala) at 12 hr, 48 hr and 5 days post infection condition. Total 2082 proteins were differentially expressed and 320 phosphorylation sites mapping to 199 phosphopeptides corresponding to 129 proteins were identified. Functional annotation of proteome data analysis reveals activation of RIG-I-like receptor and Jak-STAT signaling pathways, that lead to induction of interferon stimulated genes (ISGs) expression. The pathway analysis of phosphoproteome datasets also confirms the activation of RIG I, Jak-STAT signaling, NF-kappa B signaling and MAPK signaling pathways in the lung tissues. The induction of ISGs proteins (STAT1, STAT3, STAT5B, STAT6, IFIT5 and PKR) establishes protective antiviral immune response in duck lung tissue. Further, the protein-protein interaction network analysis identified proteins like AKT1, STAT3, JAK2, RAC1, STAT1, PTPN11, RPS27A, NFKB1 and MAPK1 as main hub proteins that might play important roles in disease progression in ducks. Together, functional annotation of proteome and phosphoproteome datasets reveals the molecular basis of the disease progression and disease resistance mechanism in ducks infected with HPAI H5N1 virus.

Knowledge graphs (KGs) play a crucial role in many applications, such as question answering, but incompleteness is an urgent issue for their broad application. Much research in knowledge graph completion (KGC) has been performed to resolve this issue. The methods of KGC can be classified into two major categories: rule-based reasoning and embedding-based reasoning. The former has high accuracy and good interpretability, but a major challenge is to obtain effective rules on large-scale KGs. The latter has good efficiency and scalability, but it relies heavily on data richness and cannot fully use domain knowledge in the form of logical rules. We propose a novel method that injects rules and learns representations iteratively to take full advantage of rules and embeddings. Specifically, we model the conclusions of rule groundings as 0-1 variables and use a rule confidence regularizer to remove the uncertainty of the conclusions. The proposed approach has the following advantages: 1) It combines the benefits of both rules and knowledge graph embeddings (KGEs) and achieves a good balance between efficiency and scalability. 2) It uses an iterative method to continuously improve KGEs and remove incorrect rule conclusions. Evaluations on two public datasets show that our method outperforms the current state-of-the-art methods, improving performance by 2.7% and 4.3% in mean reciprocal rank (MRR).

When an aircraft malfunctions, quickly and accurately identifying the faulty unit is essential for ensuring normal operation. Unfortunately, maintenance engineers often struggle to acquire the necessary fault-related knowledge due to poor management and utilization of aircraft fault documents. To address this issue, we introduce knowledge graph technology into the field of aircraft fault diagnosis, exploring its construction and application for effective knowledge management. Our work starts by analyzing the critical knowledge elements required for aircraft fault diagnosis and designing a schema layer for fault knowledge graphs. We then we then combine deep learning and heuristic rules to extract fault knowledge from both structured and unstructured data, enabling the construction of aircraft fault knowledge graphs. Finally, we develop a fault question-answering system based on fault knowledge graphs that can accurately give solutions to questions posed by maintenance engineers. Our practice demonstrates that knowledge graphs provide an effective means of managing aircraft fault knowledge, assisting engineers in locating fault reasons accurately and quickly.

The generalization of Farey graphs and extended Farey graphs are all originated from Farey graph and scale-free and small-world simultaneously. We propose a labeling of the vertices for it that allows determining all the shortest paths routing between any two vertices only based on their labels. The maximum number of shortest paths between any two vertices is huge as the product of two Fibonacci numbers, however, the label-based routing algorithm runs in linear time O(n). The existence of an efficient routing protocol for Farey-type models should help the understanding of several physical dynamic processes on it.

Combinatoric measures of entropy capture the complexity of a graph, but rely upon the calculation of its independent sets, or collections of non-adjacent vertices. This decomposition of the vertex set is a known NP-Complete problem and for most real world graphs is an inaccessible calculation. Recent work by Dehmer et al. and Tee et al. identified a number of alternative vertex level measures of entropy that do not suffer from this pathological computational complexity. It can be demonstrated that they are still effective at quantifying graph complexity. It is intriguing to consider whether there is a fundamental link between local and global entropy measures. In this paper, we investigate the existence of correlation between vertex level and global measures of entropy, for a narrow subset of random graphs. We use the greedy algorithm approximation for calculating the chromatic information and therefore Körner entropy. We are able to demonstrate close correlation for this subset of graphs and outline how this may arise theoretically.

Topological indices have been used to modeling biological and chemical properties of molecules in quantitive structure property relationship studies and quantitive structure activity studies. All the degree based topological indices have been defined via classical degree concept. In this paper we define a novel degree concept for a vertex of a simple connected graph: S degree. And also we define S indices of a simple connected graph by using the S degree concept. We compute the S indices for well-known simple connected graphs such as paths, stars, complete graphs and cycles.

The Collatz conjecture is a well-known number theory puzzle that states that every positive integer would eventually converge to the trivial cycle of 1, 2, 1, 2,... when repeatedly exposed to a particular transformation. In this transformation, even numbers are divided in half, odd numbers are tripled, and one is added. In this study, we present a new method for creating a directed graph and using it to display and analyze Collatz sequences. Our technique creates what we call a Collatz directed graph by joining an endless number of simple directed graphs, each of which corresponds to a natural number. We show by careful mathematical analysis that all positive integers are included in this Collatz directed graph. Moreover, we give an evidence that verifies the Collatz conjecture by showing that the sole cycle in this graph is the trivial cycle of 1, 2, 1, 2,... We also prove that there is no sequence that diverges to infinity in this graph. Our results provide insights into the fundamental structure of Collatz sequences and further our knowledge of the Collatz conjecture .

In large-scale parallel computing and communication systems, an interconnect network structure is usually modeled as a graph, in which vertices and edges correspond to processors and communication links, respectively. In a graph, the vertices and edges are likely to fail, so we must think about the fault tolerance of a graph. Connectivity is an important parameter in the study of faulty tolerance for a graph. In this paper, we study a special class of connectivity: $m$-component connectivity, this is a natural generalization of the classical connectivity of graphs defined in terms of the minimum vertex-cut. Let $F$ is a vertex set of $G$ $(i.e, F\subseteq V(G))$, if the following conditions are satisfied, we say $F$ is a $m$-component cut: $(1)$ $G-F$ is disconnected; $(2)$ the number of components in $G-F$ is greater than or equal to $m$. In another word, the $m$-component connectivity $c\kappa_{m}(G)$ is defined as $min\{|F|~|~F\subseteq V(G)$ and $F$ is a $m$-component cut$\}$. Determining $m$-component connectivity is still unsolved in most interconnection networks even for small $m'$s. Leaf-sort graph is a special Cayley graph, it has many special properties that are different from other Cayley graphs. So we need to pay attention to some of it's special properties when we study it. In this paper, we can get the values: $c\kappa_{3}(CF_{n})=3n-6$ $(n$ is odd$)$ and $c\kappa_{3}(CF_{n})=3n-7$ $(n$ is even$)$ for $n\geq3$; $c\kappa_{4}(CF_{n})=\frac{9n-21}{2}$ $(n$ is odd$)$ and $c\kappa_{4}(CF_{n})=\frac{9n-24}{2}$ $(n$ is even$)$ for $n\geq4$; $c\kappa_{5}(CF_{n})=6n-16$ $(n$ is odd$)$ and $c\kappa_{5}(CF_{n})=6n-18$ $(n$ is even$)$ for $n\geq5$.

During the creation and integration of a health care system based on medical knowledge graphs, it is necessary to review and select the vocabularies and definitions that best fit the information requirements of the system being developed. This implies the reuse of medical knowledge graphs; however, full importation of knowledge graphs is not a tractable solution in terms of memory requirements. In this paper we present a modularization-based method for knowledge graph reuse. A case study of graph reuse is presented by transforming the original model into a lighter one.

New setting is introduced to study co-neighborhood, neutrosophic t-neighborhood, neutrosophic quasi-vertex set, neutrosophic quasi-order, neutrosophic neighborhood, neutrosophic co-t-neighborhood, neutrosophic quasi-edge set, neutrosophic quasi-size, Neutrosophic number, neutrosophic co-neighborhood, co-neutrosophic number, quasi-number and quasi-co-number. Some classes of neutrosophic graphs are investigated.

New setting is introduced to study failed zero-forcing number and failed zero-forcing neutrosophic-number. Leaf-like is a key term to have these notions. Forcing a vertex to change its color is a type of approach to force that vertex to be zero-like. Forcing a vertex which is only neighbor for zero-like vertex to be zero-like vertex but now reverse approach is on demand which is finding biggest set which doesn’t force. LetNTG : (V,E,σ,μ) be a neutrosophic graph. Then failed zero-forcing number Z(NTG) for a neutrosophic graph NTG : (V,E,σ,μ) is maximal cardinality of a set S of black vertices (whereas vertices in V (G) \ S are colored white) such that V (G) isn’t turned black after finitely many applications of “the color-change rule”: a white vertex is converted to a black vertex if it is the only white neighbor of a black vertex. Failed zero-forcing neutrosophic-number Zn(NTG) for a neutrosophic graphNTG : (V,E,σ,μ) is maximal neutrosophic cardinality of a set S of black vertices (whereas vertices in V (G) \ S are colored white) such that V (G) isn’t turned black afterfinitely many applications of “the color-change rule”: a white vertex is converted to a black vertex if it is the only white neighbor of a black vertex. Failed zero-forcing number and failed zero-forcing neutrosophic-number are about a set of vertices which are applied into the setting of neutrosophic graphs. The structure of set is studied and general results are obtained. Also, some classes of neutrosophic graphs namely path-neutrosophic graphs, cycle-neutrosophic graphs, complete-neutrosophic graphs, star-neutrosophic graphs, bipartite-neutrosophic graphs, and t-partite-neutrosophic graphs are investigated in the terms of maximal set which forms both of failed zero-forcing number and failed zero-forcing neutrosophic-number. Neutrosophic number is reused in this way. It’s applied to use the type of neutrosophic number in the way that, three values of a vertex are used and they’ve same share to construct this number to compare with other vertices. Summation of three values of vertex makes one number and applying it to a comparison. This approach facilitates identifying vertices which form failed zero-forcing number and failed zero-forcing neutrosophic-number. In path-neutrosophic graphs, the set of vertices such that every given two vertices in the set, have distance at least two, forms maximal set but with slightly differences, in cycle-neutrosophic graphs, the set of vertices such that every given two vertices in the set, have distance at least two, forms maximal set. Other classes have same approaches. In complete-neutrosophic graphs, a set of vertices excluding two vertices leads us to failed zero-forcing number and failed zero-forcing neutrosophic-number. In star-neutrosophic graphs, a set of vertices excluding only two vertices and containing center, makes maximal set. In complete-bipartite-neutrosophic graphs, a set of vertices excluding two vertices from same parts makes intended set but with slightly differences, in complete-t-partite-neutrosophic graphs, a set of vertices excluding two vertices from same parts makes intended set. In both settings, some classes of well-known neutrosophic graphs are studied. Some clarifications for each result and each definition are provided. Using basic set not to extend this set to set of all vertices has key role to have these notions in the form of failed zero-forcing number and failed zero-forcing neutrosophic-number. The cardinality of a set has eligibility to form failed zero-forcing number but the neutrosophic cardinality of a set has eligibility to call failed zero-forcing neutrosophic-number. Some results get more frameworks and perspective about these definitions. The way in that, two vertices don’t have unique connection together, opens the way to do some approaches. A vertex could affect on other vertex but there’s no usage of edges. These notions are applied into neutrosophic graphs as individuals but not family of them as drawbacks for these notions. Finding special neutrosophic graphs which are well-known, is an open way to pursue this study. Some problems are proposed to pursue this study. Basic familiarities with graph theory and neutrosophic graph theory are proposed for this article.

New setting is introduced to study the global powerful alliance. Global powerful alliance is about a set of vertices which are applied into the setting of neutrosophic graphs. Neighborhood has the key role to define this notion. Also, neighborhood is defined based on strong edges. Strong edge gets a framework as neighborhood and after that, too close vertices have key role to define global powerful alliance based on strong edges. The structure of set is studied and general results are obtained. Also, some classes of neutrosophic graphs excluding empty, path, star, and wheel and containing complete, cycle and r-regular-strong are investigated in the terms of set, minimal set, number, and neutrosophic number. Neutrosophic number is used in this way. It’s applied to use the type of neutrosophic number in the way that, three values of a vertex are used and they’ve same share to construct this number. It’s called “modified neutrosophic number”. Summation of three values of vertex makes one number and applying it to a set makes neutrosophic number of set. This approach facilitates identifying minimal set and optimal set which forms minimal-global-powerful-alliance number and minimal-global-powerful-alliance-neutrosophic number. Two different types of sets namely global-powerful alliance and minimal-global-powerful alliance are defined. Global-powerful alliance identifies the sets in general vision but minimal-global-powerful alliance takes focus on the sets which deleting a vertex is impossible. Minimal-global-powerful-alliance number is about minimum cardinality amid the cardinalities of all minimal-global-powerful alliances in a given neutrosophic graph. New notions are applied in the settings both individual and family. Family of neutrosophic graphs has an open avenue, in the way that, the family only contains same classes of neutrosophic graphs. The results are about minimal-global-powerful alliance, minimal-global-powerful-alliance number and its corresponded sets, minimal-global-powerful-alliance-neutrosophic number and its corresponded sets, and characterizing all minimal-global-powerful alliances, minimal-t-powerful alliance, minimal-t-powerful-alliance number and its corresponded sets, minimal-t-powerful-alliance-neutrosophic number and its corresponded sets, and characterizing all minimal-t-powerful alliances. The connections amid t-powerful-alliances are obtained. The number of connected components has some relations with this new concept and it gets some results. Some classes of neutrosophic graphs behave differently when the parity of vertices are different and in this case, cycle, and complete illustrate these behaviors. Two applications concerning complete model as individual and family, under the titles of time table and scheduling conclude the results and they give more clarifications and closing remarks. In this study, there’s an open way to extend these results into the family of these classes of neutrosophic graphs. The family of neutrosophic graphs aren’t study deeply and with more results but it seems that analogous results are determined. Slight progress is obtained in the family of these models but there are open avenues to study family of other models as same models and different models. There’s a question. How can be related to each other, two sets partitioning the vertex set of a graph? The ideas of neighborhood and neighbors based on strong edges illustrate open way to get results. A set is global powerful alliance when two sets partitioning vertex set have uniform structure. All members of set have more amount of neighbors in the set than out of set and reversely for non-members of set with less members in the way that the set is simultaneously t-offensive and(t-2)-defensive. A set is global if t=0. It leads us to the notion of global powerful alliance. Different edges make different neighborhoods but it’s used one style edge titled strong edge. These notions are applied into neutrosophic graphs as individuals and family of them. Independent set as an alliance is a special set which has no neighbor inside and it implies some drawbacks for these notions. Finding special sets which are well-known, is an open way to purse this study. Special set which its members have only one neighbor inside, characterize the connected components where the cardinality of its complement is the number of connected components. Some problems are proposed to pursue this study. Basic familiarities with graph theory and neutrosophic graph theory are proposed for this article.

New setting is introduced to study the global offensive alliance. Global offensive alliance is about a set of vertices which are applied into the setting of neutrosophic graphs. Neighborhood has the key role to define this notion. Also, neighborhood is defined based on strong edges. Strong edge gets a framework as neighborhood and after that, too close vertices have key role to define global offensive alliance based on strong edges. The structure of set is studied and general results are obtained. Also, some classes of neutrosophic graphs containing complete, empty, path, cycle, star, and wheel are investigated in the terms of set, minimal set, number, and neutrosophic number. Neutrosophic number is defined in new way. It’s first time to define this type of neutrosophic number in the way that, three values of a vertex are used and they’ve same share to construct this number. It’s called “modified neutrosophic number”. Summation of three values of vertex makes one number and applying it to a set makes neutrosophic number of set. This approach facilitates identifying minimal set and optimal set which forms minimal-global-offensive-alliance number and minimal-global-offensive-alliance-neutrosophic number. Two different types of sets namely global-offensive alliance and minimal-global-offensive alliance are defined. Global-offensive alliance identifies the sets in general vision but minimal-global-offensive alliance takes focus on the sets which deleting a vertex is impossible. Minimal-global-offensive-alliance number is about minimum cardinality amid the cardinalities of all minimal-global-offensive alliances in a given neutrosophic graph. New notions are applied in the settings both individual and family. Family of neutrosophic graphs is studied in the way that, the family only contains same classes of neutrosophic graphs. Three types of family of neutrosophic graphs including m-family of neutrosophic stars with common neutrosophic vertex set, m-family of odd complete graphs with common neutrosophic vertex set, and m-family of odd complete graphs with common neutrosophic vertex set are studied. The results are about minimal-global-offensive alliance, minimal-global-offensive-alliance number and its corresponded sets, minimal-global-offensive-alliance-neutrosophic number and its corresponded sets, and characterizing all minimal-global-offensive alliances. The connection of global-offensive-alliances with dominating set and chromatic number are obtained. The number of connected components has some relations with this new concept and it gets some results. Some classes of neutrosophic graphs behave differently when the parity of vertices are different and in this case, path, cycle, and complete illustrate these behaviors. Two applications concerning complete model as individual and family, under the titles of time table and scheduling conclude the results and they give more clarifications. In this study, there’s an open way to extend these results into the family of these classes of neutrosophic graphs. The family of neutrosophic graphs aren’t study deeply and with more results but it seems that analogous results are determined. Slight progress is obtained in the family of these models but there are open avenues to study family of other models as same models and different models. There’s a question. How can be related to each other, two sets partitioning the vertex set of a graph? The ideas of neighborhood and neighbors based on strong edges illustrate open way to get results. A set is global offensive alliance when two sets partitioning vertex set have uniform structure. All members of set have more amount of neighbors in the set than out of set. It leads us to the notion of global offensive alliance. Different edges make different neighborhoods but it’s used one style edge titled strong edge. These notions are applied into neutrosophic graphs as individuals and family of them. Independent set as an alliance is a special set which has no neighbor inside and it implies some drawbacks for these notions. Finding special sets which are well-known, is an open way to purse this study. Special set which its members have only one neighbor inside, characterize the connected components where the cardinality of its complement is the number of connected components. Some problems are proposed to pursue this study. Basic familiarities with graph theory and neutrosophic graph theory are proposed for this article.

For the first time, We do fuzzification the concept of domination in crisp graph on a generalization of fuzzy graph by using membership values of vertices, α-strong edges and edges. In this paper, we introduce the first variation on the domination theme which we call vertex domination. We determine the vertex domination number γ_v for several classes of t-norm fuzzy graphs which include complete t-norm fuzzy graph, complete bipartite t-norm fuzzy graph, star t-norm fuzzy graph and empty t-norm fuzzy graph. The relationship between effective edges and α-strong edges is obtained. Finally, we discuss about vertex dominating set of a fuzzy tree with respect to a t-norm ⨂ by using the bridges and α-strong edges equivalence.

Adenoviruses (Ads) have been extensively manipulated for the development of cancer selective replication, leading to cancer cell death or oncolysis. Clinical studies using E1-modified oncolytic Ads have shown that this therapeutic platform was safe, but with limited efficacy, indicating the necessity of targeting other viral genes for manipulation. To improve the therapeutic efficacy of oncolytic Ads, we treated the entire Ad genome repeatedly with UV-light and have isolated AdUV which efficiently lyses cancer cells as reported previously [1]. In this report, we show that no mutations were observed in the early genes (E1 or E4) of AdUV while several mutations were observed within the Ad late genes which have structural or viral DNA packaging functions. This study also reported the increased release of AdUV from cancer cells. In this study, we found that AdUV inhibits tumor growth following intratumoral injection. These results indicate the potentially significant role of the viral late genes, in particular the DNA packaging genes, to enhance Ad oncolysis.

The Harmonic Graphs Conjecture states that there exists an asymptotic relation involving the Harmonic Index and the natural logarithm as the order of the graph increases. This conjecture, grounded in the novel context of Prime Graphs, draws upon the Prime Number Theorem and the sum of divisors function to unveil a compelling asymptotic connection. By carefully expanding the definitions of the harmonic index and the sum of divisors function, and leveraging the prime number theorem's approximations, we establish a formula that captures this intricate relationship. This work is an effort to contribute to the advancement of graph theory, introducing a fresh lens through which graph connectivity can be explored. The synthesis of prime numbers and graph properties not only deepens our understanding of structural complexity but also paves the way for innovative research directions.

In this paper, we give some upper and lower bounds for the multiplicative Randic index, reduced reciprocal Randic index, Narumi-Katayama index and symmetric division index a graph using solely the vertex degrees. Then we obtain upper and lower bounds for these indices for the complete graphs, path graphs and Fibonacci-sum graphs. Finally, we compared the bounds of these indices for a general graph and some special graphs.

Chellali et al. introduced two degree concepts, ve-degree and ev-degree (Chellali et al, 2017). The ve-degree of a vertex equals to number of different edges which are incident to a vertex from the closed neighborhod of v. Moreover the ev-degree of an edge e=ab equals to the number of vertices of the union of the closed neighborhoods of a and b. The most private feature of these degree concepts is, total number of ve-degrees and total number of ev-degrees equal to first Zagreb index of the graphs for triangle-free graphs. In this paper we introduce ve-degree entropy, ev-degree entropy and investigate the relations between these entropies and the first Zagreb index entropy. Finally we obtain the maximal trees with respect to ve-degree irregularity index.

In different fields in our life, like physics, coding theory and computer science, graph labeling dramas an vital role and appears in many applications. A labeling of a graph is a map which assign each element in with a positive integer number. An edge irregular total -labeling is a function such that where and are weights for any two distinct edges. In this case, has total edge irregularity strength (TEIS) if is minimum. In our paper, we defined a new type of graphs called a triple star snake graph and star snake graph . Also, we investigated TEIS for a triple star snake graph . After that, we generalized the results for star snake graph .

Tracking information diffusion is a non-trivial task and it has been widely studied across different domains and platforms. The advent of social media has led to even more challenges, given the higher speed of information propagation and the growing impact of social bots and anomalous accounts. Nevertheless, it is crucial to derive a trustworthy information diffusion graph, which is capable of highlighting the importance of specific nodes in spreading the original message. The paper introduces the interaction strength, a novel metric to model retweet cascade graphs by exploring users’ interactions. Initial findings show the soundness of the approaches based on this new metric with respect to the state-of-the-art model, and its ability to generate a denser graph, revealing crucial nodes that participated in the retweet propagation. Reliable retweet graph generation will enable a better understanding of the diffusion path of a specific tweet.

A total $m$-labelling $\alpha$ on graph $\Gamma$ is called an edge irregular total $m$-labelling if for any two different edges of $\Gamma$, their weights respect to $\alpha$ are distinct, where the weight of any edge is defined as the sum of its label and the labels of its end vertices. We determine the minimum $m$ such that $\Gamma$ can be labelled by an edge irregular total $m$-labelling whenever $\Gamma$ is an odd staircase graph or an even staircase graph.

Fowlpox virus (FPV) has been used as a vector for many years. To date, surprisingly, very little data exist on the persistence of fowlpox vaccines in chicken tissues, or what kind of immune cells respond to the vaccination at the site of inoculation. Although both humoral and cellular mediated immunity (CMI) play a part in overall immunity against FPV, little is known regarding the cell-mediated immune responses to FPV infection. The main aim of this paper was to measure persistence of the recombinant fowlpox vaccine in the skin tissues following vaccination. The results showed that the recombinant FPVs do not persist for long, and are cleared by 6 days post-vaccination (dpv). The response of immune cells (macrophages, B cells, CD4+ and CD8+ T cells) that infiltrating the site of vaccination was estimated.

A signed graph is an undirected graph such that all of its edges are labeled positive or negative. Let D be an embedding of a signed graph G in the Euclidean line. If in D for all of the vertices their positive neighbors are closer than the negative neighbors, then D is called a valid drawing of G. In this paper we show that signed trees, unicyclic graphs, and ladder graphs have a valid drawing in the Euclidean line.

The realization of the third-generation artificial intelligence (AI) requires the evolution from perceptual intelligence to cognitive intelligence, where knowledge graphs may not meet the practical needs anymore. Based on the dual channel theory, cognitive graphs are established and developed through coordinating the implicit extraction module and the explicit reasoning module as well as integrating knowledge graphs, cognitive reasoning and logical expressions, which have achieved successes in multi-hop question answering. It is desired for cognitive graphs to be widely used in advanced AI applications such as large-scale knowledge representations and intelligent responses, promoting the development of Al dramatically. This review discusses cognitive graphs systematically and elaborately, including basic concepts, generations, theories and technologies. Moreover, we try to predict the development of cognitive intelligence in the short-term future and further enlighten more researches and studies.

Chikungunya virus (CHIKV), a single-stranded RNA virus transmitted by Aedes mosquitoes, poses a significant global health threat, with severe complications observed in vulnerable populations. The only licensed vaccine, IXCHIQ, approved by the USFDA, is insufficient to address the growing disease burden, particularly in endemic regions lacking herd immunity. Monoclonal antibodies (mAbs), explicitly targeting structural proteins E1/E2, demonstrate promise in passive transfer studies, with mouse and human-derived mAbs showing protective efficacy. The article explores various vaccine candidates, including live attenuated, killed, nucleic-acid-based (DNA/RNA), virus-like particle, chimeric, subunit, and adenovirus vectored vaccines. RNA vaccines emerge as promising candidates due to their rapid response capabilities and enhanced safety profile. The review underscores the importance of E1 and E2 proteins as immunogens, emphasising their antigenic potential. Several vaccine candidates, such as CHIKV/IRES, measles vector (MV-CHIK), synthetic DNA-encoded antibodies, and mRNA-lipid nanoparticle vaccines, demonstrate encouraging preclinical and clinical study results. In addition to identifying potential molecular targets for antiviral therapy, the study looks into the roles played by Toll-like receptors, RIG-I, and NOD-like receptors in the immune response to CHIKV. It also offers insights into novel tactics and promising vaccine candidates.

Viruses can induce the fusion of infected and neighboring cells, leading to the formation of syncytia. Cell-cell fusion is mediated by viral fusion proteins on the plasma membrane of infected cells that interact with cellular receptors on neighboring cells. Viruses use this mechanism to spread rapidly to adjacent cells or escape host immunity. For some viruses, syncytium formation is a hallmark of infection and a known pathogenicity factor. For others, the role of syncytium formation in viral dissemination and pathogenicity remains poorly understood. Human cytomegalovirus (HCMV) is an important cause of morbidity and mortality in transplant patients and the leading cause of congenital infections. Clinical HCMV isolates have broad cell tropism but differ in their ability to induce cell-cell fusions, and little is known about the molecular determinants. We developed a system to analyze HCMV glycoprotein B (gB) variants in a defined genetic background. HCMV strains TB40/E and TR were used as vectors to compare the fusogenicity of six gB variants from congenitally infected fetuses with those from three laboratory strains. Five of them conferred the ability to induce fusion of MRC-5 human embryonic lung fibroblasts to one or both backbone strains, as determined by a split GFP-luciferase reporter system. The same gB variants were not sufficient to induce syncytia in infected ARPE-19 epithelial cells, suggesting that additional factors are involved. The system described here allows a systematic comparison of the fusogenicity of viral envelope glycoproteins and may help to clarify whether fusion-promoting variants are associated with increased pathogenicity.

Epidemic diseases that arise from infectious RNA viruses, particularly influenza viruses, pose a constant threat to the global economy and public health. Viral evolution has undermined the efficacy of acquired immunity from vaccines and the antiviral effects of FDA-approved drugs. As such, there is an urgent need to develop new antiviral lead agents. Natural compounds, owing to their historical validation of application and safety, have become a promising solution. In this light, a novel marine bacterium, Pseudomonas sp. M20A4R8, has been found to exhibit significant antiviral activity [half maximal inhibitory concentration (IC50) = 1.3 µg/mL, selectivity index (SI) = 919.4] against influenza virus A/Puerto Rico/8/34, surpassing the activity of chloroquine. The antiviral response by M20A4R8 extract was induced during post-entry stages of the influenza virus, indicating suitability for post-application after the establishment of viral infection. Furthermore, post-treatment with M20A4R8 extract protected the host from virus-induced apoptosis, suggesting its potential use in acute respiratory disease complexes resulting from immune effectors' overstimulation and autophagy-mediated self-apoptosis. The extract demonstrated an outstanding therapeutic index against influenza virus A/Wisconsin/15/2009 (IC50 = 8.1 µg/mL, SI = 146.2) and B/Florida/78/2015 Victoria lineage (IC50 = 3.5 µg/mL, SI = 343.8), indicating a broad anti-influenza virus activity with guaranteed safety and effectiveness. This study provides a new perspective on mechanisms for preventing a broad spectrum of viral infections through antiviral agents from novel and natural origins. Future studies on a single or combined compound from the extract hold promise, encouraging its use in preclinical challenge tests with various influenza virus strains.

The problem of quantifying the vulnerability of graphs has received much attention nowadays, especially in the field of computer or communication networks. In a communication network, the vulnerability measures the resistance of the network to disruption of operation after the failure of certain stations or communication links. If we think of a graph as modeling a network, the average lower 2-domination number of a graph is a measure of the graph vulnerability and it is defined by ${\gamma }_{2av}\left(G\right)=\frac{1}{\left|V\left(G\right)\right|}{\sum }_{v\in V\left(G\right)}{\gamma }_{2v}\left(G\right)$, where the lower 2-domination number, denoted by ${\gamma }_{2v}\left(G\right)$, of the graph G relative to v is the minimum cardinality of 2-domination set in G that contains the vertex v. In this paper, the average lower 2-domination number of wheels and some related networks namely gear graph, friendship graph, helm graph and sun flower graph are calculated. Then, we offer an algorithm for computing the 2-domination number and the average lower 2-domination number of any graph G.

A relevant aspect in the epidemiology of Tegumentary Leishmaniasis (TL) is the Leishmania parasites carrying a viral endosymbiont Leishmania RNA Virus 1 (LRV1), a dsRNA virus. Leishmania parasites carrying LRV1 are prone to causing more severe TL symptoms, increasing the likelihood of unfavorable clinical outcomes. LRV1 has been observed in cultured strains of five L. (Viannia) species, and host specificity was suggested when studying LRV1 from L. braziliensis and L. guyanensis strains. The coevolution hypothesis of LRV1 and Leishmania was based on phylogenetic analyses, implying an association between LRV1 genotypes, Leishmania species, and their geographic origins. This study aimed to investigate LRV1 specificity to Leishmania (Viannia) species hosts by analyzing LRV1 from L. (Viannia) species. To this end, LRV1 was screened in L. (Viannia) species other than L. braziliensis or L. guyanensis, and it was detected in 11 out of 15 L. naiffi and in 2 out of 4 L. shawi. Phylogenetic analyses based on partial LRV1 genomic sequencing supported the hypothesis of host specificity, as LRV1 clustered according to their respective Leishmania species hosts. These findings underscore the importance of investigating Leishmania and LRV1 coevolution and its impact on Leishmania (Viannia) species dispersion and pathogenesis in the American Continent.

Hepatitis B virus (HBV) is the dominant risk factor for hepatocellular carcinoma (HCC). HBV X protein (HBx) plays crucial roles in HCC carcinogenesis. HBx interferes with several signaling pathways including Notch1 pathway in HCC. In our study, we found that Notch1 was highly expressed in HCC especially in large HCC. Notch1 and HBx co-localized in HCC and their levels were positively correlated with each other. Notch1 expression was more elevated in HepG2.2.15 than that in HepG2. HBx activated Notch1 pathway in HepG2.2.15. Repression of HBx and Notch1 pathway attenuated the growth of HepG2.2.15. Notch1, ERK and AKT pathways were inhibited after a γ-secretase inhibitor treatment. Dual-specificity phosphatase 1 (DUSP1) and phosphatase and tensin homolog (PTEN) were up-regulated after the γ-secretase inhibitor treatment and Hes1 inhibition. Luciferase reporter assays showed that Hes1 repressed the promoters of DUSP1 and PTEN and this was reverted by γ-secretase inhibitor treatment. Western blotting demonstrated that DUSP1 dephosphorylated pERK and PTEN dephosphorylated pAKT. Collectively, we reported a link among HBx, Notch1 pathway, DUSP1/PTEN, and ERK/AKT pathways, which influenced HCC cell survival and could be a therapeutic target for HCC.

We characterize the form of the order divisor graph of cyclic groups based on the group order. Furthermore, we describe some topological indices of the order divisor graph of cyclic groups, including the Wiener index, Harary index, first Zagreb index, and second Zagreb index.

It has recently been shown that, contrary to the wide belief that a shift-enabled condition (necessary for any shift-invariant filter to be representable by a graph shift matrix) can be ignored because any non-shift-enabled matrix can be converted to a shift-enabled matrix, such a conversion in general may not hold for a directed graph with non-symmetric shift matrix. This paper extends this prior work, focusing on undirected graphs where the shift matrix is generally symmetric. We show that while, in this case, the shift matrix can be converted to satisfy the original shift-enabled condition, the converted matrix is not associated with the original graph, that is, it does not capture anymore the structure of the graph signal. We show via a counterexample, that a non-shift-enabled matrix cannot be converted to a shift-enabled one and still maintain the topological structure of the underlying graph, which is necessary to facilitate localized signal processing.

This paper presents a new method : HIVEC to learn latent vector representations of graphs in a manner that captures the semantic dependencies of sub-structures. The representations can then be used in machine learning algorithms for tasks such as graph classification, clustering etcetera. The method proposed is unsupervised and uses the information of co-occurrence of sub-structures. It introduces a notion of hierarchical embeddings that allows us to avoid repetitive learning of sub-structures for every new graph. As an alternative to deep learning methods, the edit distance similarity between sub-structures is also used to learn vector representations. We compare the performance of these methods against previous work.

The influenza virus has been the primary cause of the pandemic, posing a constant threat to human society. Due to its genetic evolution and continuous outbreak, antiviral research currently focuses on exploring a novel lead agent. A comprehensive antiviral screening discovered a marine bacterium whose extract exerted excellent efficacy against influenza viruses. Parerythrobacter sp. M20A3S10, a novel strain under the family Erythrobacteraceae, could produce carotenoids exhibiting antiviral and anticancer activity by enhancing the cellular immune system. Post-treatment of M20A3S10 extract showed outstanding therapeutic indexes: against influenza virus A/PR8 (H1N1) [selectivity index (SI) = 24.0], A/Wisconsin/15/2009 (H3N2) (SI = 30.1) and B/Florida/78/2015 (SI = 38.2). Comparably, the effectiveness was demonstrated against Zika virus (ZIKV) and dengue virus type 2 (DENV2) with an SI of 22.5 and 24.1, respectively, namely broad-spectrum activity. Of note, the antiviral responses resulted from the common replication mechanism between IAV, ZIKV, and DENV2. The stimulation of apoptosis-mediated cellular immunity prevented the viral release and protected the host, suggesting that switching from necroptosis to apoptosis is a novel antiviral target. Although the specific compound affecting the antiviral activity was not identified, its promising efficacy with broad activity will contribute to developing a strategy for preventing future pandemics.

The accurate diagnosis and effective treatment of mental health disorders such as depression remain challenging owing to the complex underlying causes and varied symptomatology. Traditional information extraction methods struggle to adapt to evolving diagnostic criteria such as the Diagnostic and Statistical Manual of Mental Disorders fifth edition (DSM-5) and to contextualize rich patient data effectively. This study proposes a novel approach for enhancing information extraction from mental health data by integrating medical knowledge graphs and large language models (LLMs). Our method leverages the structured organization of knowledge graphs specifically designed for the rich domain of mental health combined with the powerful predictive capabilities and zero-shot learning abilities of LLMs. This research enhances the quality of knowledge graphs through entity linking and demonstrates superiority over traditional information extraction techniques, making a significant contribution to the field of mental health. It enables a more fine-grained analysis of the data and the development of new applications. Our approach redefines the manner in which mental health data are extracted and utilized. By integrating these insights with existing healthcare applications, the groundwork is laid for the development of real-time patient monitoring systems. The performance evaluation of this knowledge graph highlights its effectiveness and reliability, indicating significant advancements in automating medical data processing and depression management.

Immunosenescence refers to age-related alterations of the immune system function affecting both the humoral and cellular arm of immunity. Understanding immunosenescence and its impact on vaccination of older adults is essential since primary vaccine responses in older individuals can fail to generate complete protection, especially vaccines targeting infections with increased incidence among the elderly, such as the respiratory syncytial virus. Here, we review the clinical trials of both candidate and approved vaccines against respiratory syncytial virus (RSV), which include adults aged ≥50 years, with an emphasis on the evaluation of immunogenicity parameters. Currently, there are 10 vaccine candidates and 2 vaccines approved for the prevention of RSV in the older adult population. The number of registered clinical trials for this age group amounts to 32. Our preliminary evaluation of published results and interim analyses of the RSV vaccine clinical trials indicates efficacy in older adult participants, demonstrating immunity levels that closely resemble those of younger adult participants.

An influenza A virus (H3N2) with an envelope with the same structure as COVID-19 was used for antiviral testing of material surfaces, in comparison with some results of feline calicivirus. The evaluation method used was the film adhesion method, in which the virus solution is placed on the material and adhered to it using a film. The evaluation method was based on the film adhesion method, in which the virus solution is placed on the material and adhered with a film, and the plaque method, in which the cell virus is allowed to infect the material and form plaques, but the appropriate virus concentration must be adjusted to observe the plaques. When not under that restriction, the plaques are often incomplete; this is observed. For this reason, this study applied an area measurement method that can reflect viral activity even when plaques are not obtained. This study revealed that different types of metallic materials have different antiviral properties. Specifically, the antiviral activity of iron, carbon steel, and nickel was relatively high, while that of stainless steel and titanium was relatively low. The order of antiviral activity was as follows: Fe, SS400, Ni, SUS316L, SUS304, and Ti.

Conceptual distance refers to the degree of proximity between two concepts within a conceptualization. It is closely linked with semantic similarity and relationship, but its computation relies entirely on the context of the given concepts. The DIS-C algorithm, which requires using search algorithms such as Breadth First Search, represents an advance in computing the semantic similarity/relation regardless of the type of knowledge structure and semantic relationships. The shortest path algorithm facilitates the determination of the semantic closeness between two indirectly connected concepts in an ontology by propagating local distances. This process is implemented for each concept pair to establish the most effective and efficient paths to connect these concepts. The algorithm identifies the shortest path between the concepts, allowing for the inference of the most relevant relationships between them. This approach contributes to developing a comprehensive understanding of the ontology and enhances the accuracy and precision of the semantic representation of the concepts. However, one of the critical issues is associated with the computational complexity due to the nature of the algorithm, which is errorn3. This paper studies alternatives to accelerate the DIS-C based on approximation and optimized algorithms, focusing on Dijkstra, pruned Dijkstra, and Sketched-based algorithms to compute conceptual distance. Based on the experiments, we discovered that the bottleneck can be avoided using the proposed 2-hop coverages, bringing DIS-C almost linearity.

Wireless sensor networks (WSNs) are a critical research area with numerous practical applications. WSNs are utilized in real-life scenarios, including environmental monitoring, healthcare, industrial automation, smart homes, and agriculture. As WSNs advance and become more sophisticated, they offer limitless opportunities for innovative solutions in various fields. However, due to their unattended nature, it is essential to develop strategies to improve their performance without draining the battery power of the sensor nodes, which is their most valuable resource. This paper proposes a novel sink mobility model based on constructing a bipartite graph from a deployed wireless sensor network. Using the bipartite graph’s properties, the mobile sink node can visit stationary sensor nodes in an optimal way to collect data and transmit it to the base station. We evaluated the proposed approach through simulations using the NS-2 simulator to investigate the performance of wireless sensor networks when adopting this mobility model. Our results show that using the proposed approach can significantly enhance the performance of wireless sensor networks while conserving the energy of the sensor nodes.

Recent years have seen the growing adoption of non-relational data models for representing diverse, incomplete data. Among these, the RDF graph-based data model has seen ever-broadening adoption, particularly on the Web. This adoption has prompted the standardization of the SPARQL query language for RDF, as well as the development of a variety of local and distributed engines for processing queries over RDF graphs. These engines implement a diverse range of specialized techniques for storage, indexing, and query processing. A number of benchmarks, based on both synthetic and real-world data, have also emerged to allow for contrasting the performance of different query engines, often at large scale. This survey paper draws together these developments, providing a comprehensive review of the techniques, engines and benchmarks for querying RDF knowledge graphs.

Let G be a graph with n vertices and let 1; 2; : : : ; n be the eigenvalues of Randic matrix. The Randic Estrada index of G is REE(G) = Ón i=1 ei . In this paper, we establish lower and upper bounds for Randic index in terms of graph invariants such as the number of vertices and eigenvalues of graphs and improve some previously published lower bounds.

We compute explicitly traces of one-dimensional diffusion processes. The obtained trace forms can be regarded as Dirichlet forms on graphs. Then we discuss conditions ensuring the trace forms to be conservative. Finally, the obtained results are applied to the one-dimensional diffusion related to the Bessel’s process of order $\nu$.

In mathematics, one always aims to obtain new frameworks from specific ones. This also stratified to the regality of graphs, where one can produce numerous new graphs from a specific set of graphs. In this work we define some classes of pyramid graphs created by a gear graph and we derive straightforward formulas of the complexity of these graphs, using linear algebra matrix analysis techniques and employing knowledges of Chebyshev polynomials.

Topological indices are numerical parameters of a graph which characterize its topology and are usually graph invariant. In this paper, bounds for the Randić, general Randić, sum-connectivity, the general sum-connectivity and harmonic indices for tensor product of graphs are determined by using the combinatorial inequalities and combinatorial computing.

In the last decade several projects have been developed for the digitization and semantization of cultural heritage data. They were developed to preserve and maintain this heritage, but bringing it closer to all types of users and allowing access to this information to other sectors such as tourism, education, etc. In these developments, web technologies are combined, along with the use of knowledge graphs and interactive visualisation tools. Although remarkably interesting projects have been developed, in those projects, the data visualization tools are usually focused on the project context. This makes it difficult to reuse these jobs. Additionally, there are peculiarities of cultural heritage data considered with little depth, such as uncertainty, spatial and temporal granularity, as well as other aspects, such as relationships between data. In this article, these problems are described and based on other works such as VUMO or VISO, the design of an ontology that formalizes how to visualise this information is proposed, considering these problems. In addition, the development of a platform that allows the visualisation of this information through a web application and its evaluation of its use in projects such as SILKNOW, or Arxiu Valencià del Disseny is exposed

Human influenza A viruses (IAVs) cause global pandemics and epidemics. These viruses evolve rapidly, making current treatment options ineffective. To identify novel modulators of IAV-host interactions, we re-analyzed our recent transcriptomics, metabolomics, proteomics, phosphoproteomics, and genomics/virtual ligand screening data. We identified 713 potential modulators targeting 200 cellular and two viral proteins. Anti-influenza activity for 48 of them has been reported previously, whereas the antiviral efficacy of the remaining 665 is unknown. Studying anti-influenza efficacy, immuno-modulating properties and potential resistance of these compounds or their combinations may lead to the discovery of novel modulators of IAV-host interactions, which might be more effective than the currently available anti-influenza therapeutics.

The idea of strong and weak adjacencies between vertices has been generalized into fuzzy graphs and intuitionistic fuzzy graphs (IFGs) and it is an important part of making decisions. However, one or two membership degrees are not always sufficient for making decisions on real-world problems that need an answer of types “yes, neutral, and no". Consequently, in previous work, we generalized the concept into picture fuzzy graphs (PFGs) where each element in the PFG has membership, neutral, and non-membership degrees. Moreover, we constructed the notion of the coloring of PFGs based on strong and weak adjacencies between vertices. In this paper, we investigate some properties of the chromatic number of PFGs based on the concept of strong and weak adjacencies between vertices. According to the properties, we construct an algorithm to find the chromatic number of PFGs. The algorithm is usefull when we work with large PFGs. Further, we improve the method to implement the PFG’s coloring for determining traffic signal phasing at an intersection. A case study has also been done to evaluate the method.

A simple undirected graph $\Gamma=(V_\Gamma,E_\Gamma)$ admits an $H$-covering if every edge in $E_\Gamma$ belongs to at least one subgraph of $\Gamma$ that isomorphic to a graph $H$. For any graph $\Gamma$ admitting $H$-covering, a total Labelling $\beta: V_\Gamma \cup E_\Gamma \longrightarrow \{1,2,\dots,p\}$ is called an $H$-irregular total $p$-labelling of $\Gamma$ if every two different subgraphs $H_1$ and $H_2$ of $\Gamma$ isomorphic to $H$ have distinct weights where the weight $w_\beta(K)$ of subgraph $K$ of $\Gamma$ is defined as $w_f(K):=\displaystyle \sum_{v\in V_K} f(v) + \sum_{e\in E_K} f(e)$. The smallest number $p$ for which a graph $\Gamma$ admits an $H$-irregular total $p$-labelling is called the total $H$-irregularity strength of $\Gamma$ and is denoted by $ths(\Gamma)$. In this paper, we determine the total $H$-irregularity strength of edge comb product of two graphs.

We investigate new graph characteristics namely total (vertex, edge) face irregularity strength of gen- eralized plane grid graphs Gmn under k-labeling Phi of type (Alpha, Beta, Gamma). The minimum integer k for which a vertex-edge labelled graph has distinct face weights is called the total face irregularity strength of the graph and is denoted by tfs(Gmn). In this article, the graphs G = (V;E; F) under consideration are simple, fi nite, undirected and planar. We will estimate the exact tight lower bounds for the total face irregularity strength of some families of generalized plane grid graphs.

This paper presents a new framework to classify floor plan elements and represent them in a vector format. Unlike existing approaches using image-based learning frameworks as the first step to segment the image pixels, we first convert the input floor plan image into vector data and utilize graph neural network. Our framework consists of three steps. (1) image pre-processing and vectorization of the floor plan image. (2) region adjacency graph conversion. (3) graph neural network on converted floor plan graphs. Our approach is able to capture different types of indoor elements including basic elements such as walls, doors, and symbols as well as spatial elements such as rooms and corridors. In addition, the proposed method can also detect element shapes. Experimental results show that our framework can classify indoor elements with an F1 score of 95%, with scale and rotation invariance. Furthermore, we propose a new graph neural network model that takes the distance between nodes into account, which is a valuable feature of spatial network data.

A double Roman dominating function on a graph G is a function f : V(G) → {0, 1, 2, 3} 2 with the condition that every vertex u for which f(u) = 0 is adjacent to at least one vertex v for 3 which f(v) = 3 or two vertices v1 and v2 for which f(v1) = f(v2) = 2, and every vertex u for which 4 f(u) = 1 is adjacent to at least one vertex v for which f(v) ≥ 2. The weight of a double Roman dominating function f is the value w(f) = ∑u∈V(G) 5 f(u). The minimum weight over all double 6 Roman dominating functions on a graph G is called the double Roman domination number γdR(G) 7 of G. In this paper we determine the exact value of the double Roman domination number of the 8 generalized Petersen graphs P(n, 2) by using a discharging approach.

The high level of dengue virus (DENV) seroprevalence in areas where Zika virus (ZIKV) is circulating and the cross-reactivity between these two viruses have raised concerns on the risk of increased ZIKV disease severity for patients with a history of previous DENV infection. To determine the role of DENV pre-immunity in ZIKV infection, we analysed the T and B cell responses against ZIKV in donors with or without previous DENV infection. Using PBMCs from donors living in an endemic area in Colombia, we have identified, by interferon (IFN)-γ enzyme-linked immunospot (ELISPOT) assay, most of the immunodominant ZIKV T-cell epitopes in the non-structural proteins NS1, NS3 and NS5. Analyses of the T and B-cell responses in the same donors revealed a stronger T-cell response against peptides conserved between DENV and ZIKV, with a higher level of ZIKV-neutralizing antibodies in DENV-immune donors, in comparison with DENV-naïve donors. Strikingly, the potential for antibody mediated enhancement of ZIKV infection was reduced in donors with sequential DENV and ZIKV infection in comparison with donors with DENV infection only. Altogether, these data suggest that individuals with DENV immunity present improved immune responses against ZIKV.

The origins of directed acyclic graphs (DAGs) date back to the emergence of ‘graph theory’ in the early 1700s (Biggs et al. 1986). DAGs are conceptual or literal, diagrammatic representations of causal paths between variables which are constructed – as their name suggests – on the basis of two over-riding principles: first, that all causal paths are ‘directed’ (i.e. for each pair of variables, only one can represent the cause, while the other must be its consequence); and second, that no direct cyclical paths, or indirect cyclical pathways (comprising sequences of consecutive paths) are allowed, such that no consequence can be considered its own direct or indirect cause (hence ‘acyclic’; Law et al., 2012). As such DAGs reflect the knowledge, presumptions, assumptions and/or speculation of the analyst(s) concerned regarding the causal relationships between each of the variables included therein. Current convention dictates that variables are represented as nodes/vertices, and that any causal paths between variables are represented as directed arcs/edges/lines, often in the form of arrows (see Figure 1). Although each arc indicates the presence and direction of a known/presumed/assumed/speculative causal relationship between the two variables concerned, drawing an arc does not require the sign, magnitude, precision or shape of the relationship to be known or declared (Tennant et al., 2021). In this respect, DAGs provide a simple, uncomplicated, accessible and entirely nonparametric approach for postulating causal relationships amongst any variables of interest even when these are uncertain, unknown or entirely speculative (Ellison, 2020). Nonetheless, as a result of the parametric constraints imposed by the presence/absence of possible arcs within any given DAG, these also reflect and support a number of more sophisticated statistical applications which make it possible to use DAGs to inform the design of multivariable statistical models that reflect the causal structure(s) involved – albeit without the need to know or understand the mathematical technicalities on which these are based (Lewis and Kuerbis, 2016). These features make DAGs attractive cognitive, educational and analytical tools for strengthening the epistemological, theoretical and empirical basis of causal inference, and there has been a recent proliferation in the use of DAGs across a range of applied scientific disciplines (e.g. Knight and Winship, 2013), and an associated upsurge in analytical methods training (e.g. Elwert, 2011; Gilthorpe, 2017; Hernán 2018; Roy, 2021; Hünermund, 2021). This Chapter reflects on a decade of delivering medical statistics training to undergraduate medical students at the University of Leeds between 2012-2021 in which the third year research, evaluation and special studies module (‘RESS3’) has used DAGs to support the development of applied statistical skills relevant to the extended student-selected research and evaluation projects (ESREP) students undertake in their fourth and final years (Ellison, 2021; Ellison et al., 2014a,b). Based on successive iterations of the structure and content of the RESS3 module, together with notes made during formal and informal planning and review meetings with module leads, lecturers, tutors and students, we draw on the claims and criticisms made of DAGs in the epidemiological literature to identify a number of explicit strengths (and associated, often implicit. weaknesses) that are central to their use in prediction and causal inference modelling. While using DAGs requires (and benefits from) a clear understanding of their non-parametric nature and parametric implications, the weaknesses of DAGs seem likely to reflect both: the challenges inherent in the modelling of data generating processes when these are imperfectly understood; and troublesome cognitive and heuristic tendencies common to all analytical tools – in which the tool facilitates the task in hand by reducing the necessity (and benefits of) exploring uncertainties and identifying assumptions. These, more epistemological considerations appear particularly challenging for medical undergraduates to grasp (Ellison, 2021), but also appear poorly understood by many established analysts and clinical epidemiologists (Ellison, 2020).

In this paper, we propose a method for assessing the effectiveness of entropy features using several chaotic mappings. We anlyze fuzzy entropy (FuzzyEn) and neural network entropy (NNetEn) on four discrete mappings: the logistic map, the sine map, the Planck map, and the two-memristor-based map, with a base length time series of 300 elements. FuzzyEn is shown to have improved global efficiency (GEFMCC) in the classification task compared to NNetEn. At the same time, there are local areas of the time series dynamics in which the classification efficiency NNetEn is higher than FuzzyEn. The results of using horizontal visibility graphs (HVG) instead of the raw time series are also shown. GEFMCC decreases after HVG time series transformation, but there are local areas of the time series dynamics in which the classification efficiency increases after including the HVG. The scientific community can use the results to explore the efficiency of entropy-based classification of time series.

The minimum vertex cover (MVC) problem is a canonical NP-hard combinatorial optimization problem, aiming to find a smallest set of vertices such that every edge has at least one endpoint in the set, which has extensive applications in cyber security, scheduling, and monitoring link failures in wireless sensor networks (WSNs). Numerous local search algorithms have been proposed to obtain a “good” vertex cover. However, due to the NP-hard nature, it is challenging to efficiently solve the MVC problem, especially on large graphs. In this paper, we propose an efficient local search algorithm for MVC called TIVC, which is based on two main ideas: A 3-improvements (TI) framework with tiny perturbation, and an edge selection strategy. We conducted experiments on real-world large instances of a massive graph benchmark. Compared with two state-of-the-art MVC algorithms, TIVC shows superior performance in accuracy and possesses a remarkable ability to identify significantly smaller vertex covers on many graphs.

The independent set, IS, on a graph $G=(V,E)$ is $V^{*}\subseteq V$ such that no two vertices in $V^{*}$ have an edge between them. The MIS problem on G seeks to identify an IS with maximum cardinality, i.e. MIS. $V^{*}\subseteq V$ is a vertex cover, i.e. VC of $G=(V,E)$ if every $e\in E$ is incident upon at least one vertex in $V^{*}$ . $V^{*}\subseteq V$ is dominating set, DS, of $G=(V,E)$ if $\forall v\in V$ either $v\in V^{*}$ or $\exists u\in V^{*}$ and $(u,v)\in E$ . The MVC problem on G seeks to identify a vertex cover with minimum cardinality, i.e. MVC. Likewise, MCV seeks a connected vertex cover, i.e. VC which forms one component in G, with minimum cardinality, i.e. MCV. A connected DS, CDS, is a DS that forms a connected component in G. The problems MDS and MCD seek to identify a DS and a connected DS i.e. CDS respectively with minimum cardinalities. MIS, MVC, MDS, MCV and MCD on a general graph are known to be NP-complete. Polynomial time algorithms are known for bipartite graphs, chordal graphs, cycle graphs, comparability graphs, claw-free graphs, interval graphs and circular arc graphs for some of these problems. We introduce a novel graph class, layered graph, where each layer refers to a subgraph containing at most some k vertices. Inter layer edges are restricted to the vertices in adjacent layers. We show that if $k=\Theta (log\mid V\mid )$ then MIS, MVC and MDS can be computed in polynomial time and if $k=O\left({(log\mid V\mid )}^{\alpha }\right)$ , where $\alpha <1$ , then MCV and MCD can be computed in polynomial time. If $k=\Theta \left({(log\mid V\mid )}^{1+ϵ}\right)$ , for $ϵ>0$ , then MIS, MVC and MDS require quasi-polynomial time. If $k=\Theta (log\mid V\mid )$ then MCV, MCD require quasi-polynomial time. Layered graphs do have constraints such as bipartiteness, planarity and acyclicity.

Tick-borne encephalitis virus (TBEV) is one of the most threatening pathogens which affects the human central nervous system (CNS). TBEV circulates widely in Northern Eurasia. According to ECDC the number of TBE cases increase annually. There is no specific treatment for the TBEV infection, thus vaccination is the main preventive measure. Despite the existence of several inactivated vaccines currently being licensed, the development of new TBEV vaccines remains a leading priority in countries endemic to this pathogen. Here we report new recombinant virus made by infectious subgenomic amplicon (ISA) approach using TBEV and yellow fever virus vaccine strain (YF17DD-UN) as a genetic backbone. The recombinant virus is capable of effective replication in mammalian cells and induce TBEV-neutralizing antibodies in mice. Unlike the original vector based on the yellow fever vaccine strain chimeric virus became neuroinvasive in doses of 107-106 PFU and can be used as a model of Flavivirus neuroinvasiveness, neurotropism and neurovirulence. These properties of hybrid structures are the main factors limiting their practical use as vaccines platforms.

Dengue virus (DENV), being one of the lethal pathogens in the hot climatic regions of the world, have been extensively studied to decipher its mechanism of pathogenesis and missing links of its life cycle. With respect to the entry of DENV, multiple receptors have been recognised in different cells of the human body. However, scientists still argue whether these identified receptors are the exclusive entry mediators for the virus. Adding to the complexity, DENV has been reported to be infecting multiple organ types in its human host. Also, more than one receptor in a particular cell has been discerned to take part in mediating the ingress of DENV. In this review, we aim to discuss about the different cells of the human immune system that support DENV infection and their corresponding receptors that DENV deploy to gain access to the cells.

Background: Cytokines and chemokines are critical regulators of innate and adaptive immunities during viral infection. We examined innate and adaptive immune responses to hepatitis C virus (HCV) and hepatitis B virus (HBV) at baseline and against controls. Methods: Twenty-seven cytokines were evaluated before treatment in 27 patients with chronic hepatitis C(CHC) [genotype1 (n=20), genotype2 (n=7), HCVRNA 5.72IU/ml] and 12 chronic hepatitis B(CHB) [e-antigen (Ag) (+) (n=5), e-Ag (-) (n=7), HBVDNA 6.191.31Logcopies/ml] and against controls(n=5). Results: Th1 and Th2 cytokines were significantly higher (p<0.05) in CHB than in CHC. The levels of IL-IL10 in CHC and CHB, and IL15 in CHC(genotype2) and CHB were significantly lower (p<0.05) than in controls. The levels of CXCL8 in CHC and CHB, IL12 in CHC and CHB [e-Ag (-)] and CXCL10 in CHC and CHB were significantly higher (p<0.05) than in controls. IFN-γwas higher in CHB than in controls. Conclusion: Cytokines levels differed between CHB and CHC before treatment. Innate immune responses were impaired in CHB with HBeAg(-) and CHC, but not in CHB with HBeAg(+) with high viral loads. Adaptive immune responses were impaired in CHB and CHC and appear to reflect the distinct state of virus-host immune interactions between CHB and CHC.

Background Cytomegalovirus (CMV) is a major pathogen that cause remarkable rate of morbidity and mortality, especially in immunocompromised patients. It is important to find risk factors associated with CMV viremia. We studied the differences in CMV seropositivity in relation to liver function biomarkers in male and female Saudi population in an attempt to understand the variation in the CMV seroprevalence with sex and find the risk factor to develop liver dysfunction or hepatocellular carcinoma. Material and subjects: The CMV- IgG and IgM were screened in serum samples of 150 non- A-G hepatities patients with elevation of liver profiles (ALT, AST, ALP and GGT) and categorized as males and females. Samples were collected from different general hospitals and polyclinic in KSA from March 2014 to June 2015. A correlation between CMV seropositivity measured with both antibodies and liver enzymes were tested. Receiver operating characteristics (ROC) analysis and multiple regressions were done for the obtained data. Results: Our study shows that females had much higher IgG and IgM compared to age-matching males. A significant correlation between both antibodies and liver enzymes (AST, ALT) was recorded. Less significant correlation of both IgG and IgM with GGT was also observed. Receiver operating characteristics (ROC) analysis revealed that both IgG and IgM can be used as excellent predictive markers for CMV infection as both recorded 100% specificity and sensitivity together with area under the curve of 1 in males and females. Multiple regression analysis ascertain the correlation between both antibodies as dependent variables and liver enzymes as independent variables with ALT being the most affected enzyme with CMV seropositivity especially in females. Conclusion:he data discussed above This study shows that CMV is capable of initiating and accelerating liver dysfunction in both sexes. The high seroprevalence in females at reproductive age is especially important as they can transmit the virus to their developing fetus. Prevention of CMV infection in young girls 11-14 years old, through counseling on hygiene or possible future vaccination, may lead to a decrease of congenital CMV infections with the concomitant risk of developing liver dysfunction or hepatocellular carcinoma. Keywords: Cytomegalovirus, Alanine transaminase, Aspartate transaminase Alkaline phosphatase, γ-Glutamyltranspeptidase, liver function.

Face routing has been adopted in wireless sensor networks (WSNs) where topological changes occur frequently or maintaining full network information is difficult. For message forwarding in networks, a planar graph is used to prevent looping, and because long edges are removed by planarization and the resulting planar graph is composed of short edges, messages are forwarded along multiple nodes connected by them even though they can be forwarded directly. To solve this, face routing using information on all nodes within 2-hop range was adopted to forward messages directly to the farthest node within radio range. However, as the density of the nodes increases, network performance plunges because message transfer nodes receive and process increased node information. To deal with this problem, we propose a new face routing using the planar graphs of neighboring nodes to improve transfer efficiency. It forwards a message directly to the farthest neighbor and reduces loads and processing time by distributing network graph construction and planarization to the neighbors. It also decreases the amount of location information to be transmitted by sending information on the planar graph nodes rather than on all neighboring nodes. Simulation results show that it significantly improves transfer efficiency.

Chikungunya virus (CHIKV) is an alphavirus that causes febrile illness punctuated by severe polyarthralgia. After the emergence of CHIKV in the Western Hemisphere, multiple reports of congenital infections were published that documented neurological complications, cardiac defects, respiratory distress, and miscarriage. The Western Hemisphere is endemic to several alphaviruses and whether antigenic cross-reactivity can impact the course of infection has not been explored. Recent advances in biomedical engineering have produced cell co-culture models that replicate the cellular interface at the maternal fetal axis. We employed a trans-well assay to determine if cross-reactive antibodies affected the movement and replication of CHIKV across placental cells and into an embryoid body. The data show that antibodies to Venezuelan equine encephalitis virus (VEEV) significantly reduced CHIKV viral load in embryoid bodies. The data highlight that viral pathogenesis can be cell-specific and that exploiting antigenic cross-reactivity could be an avenue for reducing the impact of congenital CHIKV infections.

Zika virus (ZIKV) is a widespread mosquito-borne pathogen. Phylogenetically, two lineages of the ZIKV are distinguished: African and Asian-American. The latter became the cause of the 2015-2016 pandemic with severe defeat to newborns. In West African countries the African lineage has been found, but there is evidence of the emergence of Asian-American lineage in Cape Verde and Angola. This highlights the need not only to monitor the ZIKV, but also to sequence the isolates. In this article, we present a case report of Zika fever in a pregnant woman from Guinea, identified in 2018. Viral RNA was detected by qRT-PCR in serum sample. In addition, seroconversion of anti-Zika IgM and IgG antibodies was detected in repeated blood samples. Subsequently, the virus was isolated in C6/36 cell line. The detected ZIKV belonged to the African lineage, the Nigerian sublineage. The strains with the closest sequences were isolated from mosquitoes in Senegal in 2011 and 2015. In addition, we conducted serological screening of 116 blood samples collected from patients presenting to the hospital of Faranah with fevers during the period 2018-2021. As a result, it was found that IgM-positive patients occurred each year, seroprevalence varied between 5.6% and 17.1%.

According to the World Health Organization, approximately 20 million people worldwide are infected annually with the hepatitis E virus (HEV). There are 4 main genotypes of HEV. Genotype 1 and genotype 2 are common in developing countries and are transmitted by contaminated water from a fecal-oral route. Genotype 3 and genotype 4 are common in developed countries and can lead to occasional transmission to humans by undercooked meat. Hepatitis E virus 1 and HEV3 can lead to fulminant hepatitis, and HEV3 can lead to chronic hepatitis and cirrhosis in immunocompromised patients. The majority of patients with HEV infection are asymptomatic and usually have spontaneous viral clearance without treatment. However, infection in immunocompromised individuals can lead to chronic HEV infection. Both acute and chronic HEV infections can have extrahepatic manifestations. No specific treatment is required for acute HEV infection, no treatment has been approved in chronic infection and no HEV vaccine has been approved by the (United States) Food and Drug Administration. This review focuses on the molecular virology (HEV life cycle, genotypes, model systems, zoonosis), pathogenesis, clinical manifestation, and treatment of chronic HEV infection, especially in immunocompromised patients, to provide clinicians a better understanding of the global distribution of these infections and the significant effect they can have on immunocompromised patients.

The progressive reappearance of the Zika virus (ZIKV) infection since October 2013 and its circulation in >70 countries and territories (from French Polynesia to Brazil and other countries in the Americas, with sporadic spread in Europe and the East) has long been reported as a global public health emergency. ZIKV is a virus transmitted by arthropods (arboviruses), mainly by Aedes mosquitoes. ZIKV can also be transmitted to humans through mechanisms other than vector infection such as sexual intercourse, blood transfusions, mother-to-child transmission. The latter mode of transmission can give rise to a severe clinical form called Congenital Zika Syndrome (CZS) which can result in spontaneous abortion or serious pathological alterations in the fetus such as microcephaly, neurological and orofacial anomalies. In this study, beside a succinct overview of the etiological, microbiological, epidemiological aspects and modes of transmission of Zika virus infection, we have focused our attention on the pathogenetic and histopathological aspects in pregnancy and the pathogenetic and molecular mechanisms that can determine microcephaly, and consequently the clinical alterations, typical of the fetus and newborns, in a subject affected by CZS.

Paper-based sensors, microfluidic platforms and electronic devices have attracted attention in the past couple of decades because they are flexible, can be recycled easily, environmentally friendly, and inexpensive. Here we report a paper aptamer-based potentiometric sensor to detect the whole Zika virus for the first time with a minimum sensitivity of 2.6 nV/Zika and the minimum detectable signal (MDS) of 1.2x10⁶ Zika. Our paper sensor works very similar to a P-N junction where a junction is formed between two different wet regions with different electrochemical potentials near each other on the paper. These two regions with slightly different ionic contents, ionic species and concentrations, produce a potential difference given by the Nernst equation. Our paper sensor consisted of a 2-3 mm x 10 mm segments of a paper with a conducting silver paint contact patches on its two ends. The paper is soaked in a buffer solution containing aptamers designed to bind to the capsid proteins on Zika. Atomic force microscopy studies were carried out to show both the aptamer and Zika become immobilized in the paper. We then added the Zika (in its own buffer) to the region close to one of the silver-paint contacts. The Zika virus (40 nm diameter with 43 kDa or 7.1x10^-20 gm weight), became immobilized in the paper’s pores and bonded with the resident aptamers creating a concentration gradient. The potential measured between the two silver paint contacts reproducibly became more negative as upon adding the Zika. We also showed that an LCD powered by the sensor, can be used to detect the sensor output.

Rosette caused by rose rosette virus (RRV) is the most devastating malady of rose in the United States. Because of the recent discovery of the virus and the completion of Koch’s postulates all assumptions about the disease are based on visual observations of material that may or may have not been infected by the virus. This study addresses several aspects of virus and disease epidemiology. Twenty rose genotypes were screened for mite and/or virus resistance. Phyllocoptes fructiphilus the only known vector of RRV, was able to establish, lay eggs and develop to nymphs and adults in all genotypes. ‘Stormy Weather’ shows resistance to the virus as assessed by both mite and cleft-grafting transmission experiments. The acquisition/latent and inoculation access periods were studied revealing long acquisition/latent periods but rapid inoculation time frames. The outputs of this study will assist in the better management of the vector and the disease. The resistant genotype identified could be used in areas with high disease pressure to minimize spread and for identification of the mechanisms behind resistance or as breeding material to incorporate virus resistance to new cultivars. The short inoculation access period indicates that chemical control for the vector may be a challenging undertaking.

In the rapidly evolving field of real estate economics, the prediction of house prices continues to be a complex challenge, intricately tied to a multitude of socio-economic factors. However, traditional predictive models have often overlooked the spatial interdependencies that play a vital role in shaping housing prices. This study applies Graph Neural Networks (GNNs) on Open Statistics Knowledge Graphs to model spatial dependencies and predict house prices across Scotland’s 2011 data zones. To this end, integrated statistical indicators are retrieved from the official Scottish Open Government Data portal. The three representative GNN algorithms employed - ChebNet, GCN, and GraphSAGE - demonstrate higher prediction accuracy than traditional models, including the tabular-based XGBoost and a simple Multi-Layer Perceptron (MLP). In addition, local and global explainability are employed to increase transparency and trust in the predictions made by the most accurate GNN - GraphSAGE. The global feature importance is determined by a logistic regression surrogate model while the local, region-level understanding of the GNN predictions is achieved through the use of GNNExplainer. Explainaibility results are compared with those from a previous work that applied the XGBoost machine learning algorithm and the SHapley Additive exPlanations (SHAP) explainability framework on the same dataset. Interestingly, both global surrogate model and the SHAP approach underscored the Comparative Illness Factor, a health indicator, and the ratio of detached dwellings as the most crucial features in the global explainability. In the case of local explanations, while both methods showed similar results, the GNN approach provided a richer, more comprehensive understanding of the predictions for two specific data zones.

Yaba monkey tumor virus (YMTV) and Tanapox virus (TPV) are members of the Yatapoxvirus genus and can infect humans and other primates. Despite the threat posed by yatapoxviruses, the factors determining their host range are poorly understood. In this study, we analyzed the ability of YMTV and TPV orthologs of vaccinia virus K3 (called 012 in YMTV and TPV), which share 75% amino acid identity with one another, to inhibit PKR from 15 different primate species. We first used a luciferase-based reporter, and found that YMTV and TPV K3 orthologs inhibited PKR in a species-specific manner and showed distinct PKR inhibition profiles. TPV 012 inhibited PKR from 11 primates, including human, substantially better than YMTV 012. In contrast, both K3 orthologs inhibited the other four primate PKRs comparably well. Using YMTV 012 and TPV 012 hybrids, we mapped the region responsible for the differential PKR inhibition to the C- terminus of the K3 orthologs. Next, we generated chimeric vaccinia virus strains to investigate whether TPV K3 and YMTV K3 orthologs could rescue replication of a vaccinia virus strain that lacks PKR inhibitors K3L and E3L. Virus replication in primate-derived cells generally correlated with the patterns observed in the luciferase-based assay. Together, these observations demonstrate that yatapoxvirus K3 orthologs have distinct PKR inhibition profiles and inhibit PKR in a species-specific manner, which may contribute to the differential susceptibility of primate species to yatapoxvirus infections.

The introduction of three single nucleotide mutations into the genome of the virulent RVFV ZH548 strain allows the rescue of a fully attenuated virus in mice (ZH548-rA2). These mutations are located in the viral genes encoding the RdRp and the non-structural protein NSs. This paper shows the results obtained after subcutaneous inoculation of ZH548-rA2 in adult sheep and subsequent challenge with the parental virus (ZH548-rC1). Inoculation with ZH548-rA2 virus caused no detectable clinical or pathological effect in sheep, whereas inoculation of the parental rC1 virus caused lesions compatible with viral infection characterized by the presence of scattered hepatic necrosis. Viral infection was confirmed by immunohistochemistry, with hepatocytes within the necrotic foci appearing as the main cells immunolabelled against viral antigen. Furthermore, inoculation of sheep with rA2 virus prevented the liver damage expected after rC1 virus inoculation, suggesting a protective efficacy in sheep which correlated with the induction of both humoral and cell mediated immune responses.

In addition to the risk of vaccine failure caused by strain mismatch, the production of inactivated FMD vaccines is dangerous if adequate biosafety cannot be maintained. Using a high-throughput sequencing protocol optimized for short nucleic acid fragments, the composition of a local inactivated vaccine was analyzed in depth. The serotype O strain identified in the vaccine was genetically identical to viruses found in recent FMD outbreaks in Egypt.

Rottlerin(R) is a natural extract from Mallotus philippensis with antiviral properties. Feline Infectious Peritonitis (FIP) is a fatal disease characterized by systemic granulomatous inflammation and high mortality, with no established prevention or cure. We investigated antiviral effect of liposome loaded R, Rottlerin-liposome(RL) against Feline infectious peritonitis virus (FIPV), the causative agent. We demonstrated that R and RL inhibited FIPV replication in dose dependently with a PKCδ related manner, not only in the early endocytosis step but also in the late step of replication. RL resolved the low solubility issue of rottlerin and improved its inhibition efficacy at the cellular level. Based on these findings, we suggest that RL has a value for further research as a potential antiviral agent against FIPV.

Bovine Respiratory Disease Complex, a complex respiratory ailment in cattle, results from a combination of viral and bacterial factors, compounded by environmental stressors such as overcrowding, transportation, and adverse weather conditions. Its impact extends beyond mere health concerns, posing significant economic threats to the cattle industry. This study presents an extensive investigation into viral pathogens associated with BRDC in Serbian cattle, utilizing serum samples and nasal swabs. A cross-sectional study was conducted in 2024 across 65 randomly selected dairy farms in Serbia, excluding vaccinated farms. Farms were categorized by livestock count: small (≤50 animals), medium-sized (51-200 animals), and large (&gt;200 animals). Serum samples from adult cattle older than 24 months were tested for antibodies against BVDV, BHV-1, BRSV, and BPIV3. Nasal swab samples from animals with respiratory signs were tested using PCR for viral genome detection. Results showed seropositivity for all four viruses across all farms, with BPIV3 exhibiting universal seropositivity. Medium-sized and large farms demonstrated higher seropositivity for BRSV and BHV-1 compared to small farms (p&lt;.05). True seroprevalence estimates at the animal level were 84.29% for BRSV, 54.08% for BVDV, 90.61% for BHV-1, and 84.59% for BPIV3. PCR analysis of nasal swabs revealed positive detections for BRSV (20%), BHV-1 (1.7%), BVDV (8%), and BPIV3 (10.9%). Influenza D virus was not found in any of samples. This study provides critical insights into the prevalence and circulation of viral pathogens associated with BRDC in Serbian cattle, emphasizing the importance of surveillance and control measures to mitigate the impact of respiratory diseases in cattle populations.