A5034004918- Graph Labeling and Dimension Problems
- Graph theory and applications
- Advanced Graph Theory Research
- Computational Drug Discovery Methods
- Topic Modeling
- Interconnection Networks and Systems
- Speech and dialogue systems
- Natural Language Processing Techniques
- Phase Equilibria and Thermodynamics
- Caching and Content Delivery
- Thermodynamic and Exergetic Analyses of Power and Cooling Systems
- Synthesis and Properties of Aromatic Compounds
- Parallel Computing and Optimization Techniques
- Graph Theory and Algorithms
- Data Management and Algorithms
- Digital Games and Media
- Intelligent Tutoring Systems and Adaptive Learning
- Innovative Teaching and Learning Methods
- Sentiment Analysis and Opinion Mining
- Geological Modeling and Analysis
- Ultrasonics and Acoustic Wave Propagation
- Advanced Frequency and Time Standards
- Disaster Response and Management
- Cognitive Radio Networks and Spectrum Sensing
- Petroleum Processing and Analysis
Harbin Medical University
2025
Tianjin Chengjian University
2024
Qinghai Normal University
2022-2024
Nanjing Tech University
2024
Hunan University
2023
Chinese Academy of Sciences
2022-2023
University of Chinese Academy of Sciences
2022-2023
Hohai University
2023
Institute of Information Engineering
2022-2023
Zhengzhou University
2022-2023
The augmented Zagreb index (\rm{AZI} for short) of a graph $G$, introduced by Furtula et al. in 2010, is defined as ${\rm AZI}(G)=\sum\limits_{v_iv_j\in E(G)}{\left(\frac{d(v_i)d(v_j)}{d(v_i)+d(v_j)-2}\right)}^3$, where $E(G)$ the edge set and $d(v_i)$ denotes degree vertex $v_i$. In this paper, we give some new bounds on general connected graphs, molecular trees triangle-free graphs. \\[2mm] {\bf Keywords:} Agumented index; trees; Triangle-free
Cardiac hypertrophy is a precursor to heart failure and represents significant global cause of mortality, thereby necessitating timely effective therapeutic interventions. Zinc finger protein 36 (Zfp36) recognised as critical regulator ferroptosis; however, its role underlying mechanisms in cardiac remain largely unexplored. This study aims investigate the regulatory function Zfp36 ferroptosis within context hypertrophy. Single-cell sequencing analysis demonstrated reduction expression...
For a vertex set M and an edge uv of graph G, if there exists x∈M such that dG(x,u)≠dG−uv(x,u) or dG(x,v)≠dG−uv(x,v), then is monitored by x. A the G distance-edge-monitoring (DEM set, for short) all edges e∈E(G) are some vertices M. The number dem(G) defined as minimum cardinality DEM G. In this paper, we prove dem(G)≤n−⌊g(G)/2⌋ connected which not tree, order n, where g(G) (g length shortest cycle in Furthermore, equality holds only C4 complete Kn (n≥3). Let Gk,g be class graphs with k...
Foucaud et al. recently introduced and initiated the study of a new graph-theoretic concept in area network monitoring. Given graph G = (V(G), E(G)), set M ⊆ V(G) is distance-edge-monitoring if for every edge e ∈ E(G), there vertex x y such that belongs to all shortest paths between y. The smallest size denoted by dem(G). Denoted – (resp. G\u) subgraph obtained removing from u together with its incident edges G). In this paper, we first show dem(G e) dem(G) ≤ 2 any E(G). Moreover, bound...
Empathy, which is widely used in psychological counseling, a key trait of everyday human conversations. Equipped with commonsense knowledge, current approaches to empathetic response generation focus on capturing implicit emotion within dialogue context, where the emotions are treated as static variable throughout However, change dynamically between utterances, makes previous works difficult perceive flow and predict correct target response, leading inappropriate response. Furthermore,...
Let G be a graph with vertex set V(G) and edge E(G). For any e∈E(G) u,v∈V(G), the e is monitored by two vertices u v in if dG(u,v)≠dG−e(u,v). A M of monitoring-edge-geodetic for there exists pair u,v∈M such that u, v. The number meg(G) cardinality minimum MEG-set G. In this paper, we obtain exact values or bounds MEG numbers products, including join, corona, cluster, lexicographic products direct products.
Let [Formula: see text] be a graph. A set is local resolving of if there exists such that for any text]. The metric dimension the minimum cardinality all sets In this paper, we characterize graphs with Next, obtain Nordhaus–Gaddum-type results dimension. Finally, several graph classes given.
Many macro-level variables have been used in forecasting crude oil price volatility. This article aims to identify which the greatest impact and give more accurate predictions. The GARCH-MIDAS model with variable selection enables us incorporate many a single model. By combining log-likelihood function adaptive lasso penalty, three most informative determinants identified, namely, macroeconomic uncertainty, financial uncertainty default yield spread. Out-of-sample results show that using...
Foucaud et al. recently introduced and initiated the study of a new graph-theoretic concept in area network monitoring. Given graph $G=(V(G), E(G))$, set $M \subseteq V(G)$ is distance-edge-monitoring if for every edge $e \in E(G)$, there vertex $x M$ $y such that $e$ belongs to all shortest paths between $x$ $y$. The smallest size $G$ denoted by $\operatorname{dem}(G)$. Denoted $G-e$ (resp. $G \backslash u$) subgraph obtained removing from $u$ together with its incident edges $G$). In this...
<abstract><p>Gutman proposed the concept of Sombor index. It is defined via term $ \sqrt{d_F(v_i)^2+d_F(v_j)^2} $, where d_F(v_i) degree vertex v_i in graph F $. Also, reduced index and Average have been introduced recently, these topological indices good predictive potential mathematical chemistry. In this paper, we determine extreme molecular graphs with maximum value extremal connected (reduced) Some inequalities relations among chemistry are presented, topology including...
The vertex-degree function index Hf(Γ) is defined as Hf(Γ)=∑v∈V(Γ)f(d(v)) for a f(x) on non-negative real numbers. In this paper, we determine the extremal graphs with maximum (minimum) vertex degree in set of all n-vertex chemical trees, and connected graphs. We also present Nordhaus–Gaddum-type results Hf(Γ)+Hf(Γ¯) Hf(Γ)·Hf(Γ¯).
Let [Formula: see text] be a graph. For any text], if there exists such that we say resolving text]. A set of vertices in is local for The metric dimension the minimum cardinality all sets In this paper, study relation between and Furthermore, construct graph Finally, investigate several special line graphs.
Motivated by the problem of network monitoring, Foucaud, Krishna and Ramasubramony Sulochana introduced concept monitoring edge-geodetic set a related graph invariant. A (MEG-set for short) is such that removal any edge changes distance between some pair vertices in set. The minimum size called number. In this paper, we study numbers well-known networks, including folded hypercube, [Formula: see text]-cube, prism graph, anti-prism Jahangir windmill graphs.