检索结果-内蒙古大学图书馆

Knowledge graph of wastewater-based epidemiology development: A data-driven analysis based on research topics and trends

引用

ENVIRONMENTAL SCIENCE AND POLLUTION RESEARCH 2023年第11期30卷 28373-28382页

作者： Gao, Zhihan Gao, Min Chen, Chun-Hua Zhou, Yifan Zhan, Zhi-Hui Ren, Yuan South China Univ Technol Sch Environm & Energy Higher Educ Mega Ctr Guangzhou 510006 Peoples R China South China Univ Technol Sch Comp Sci & Engn Guangzhou 510006 Peoples R China South China Univ Technol Sch Software Engn Guangzhou 510006 Peoples R China South China Univ Technol Sch Elect & Informat Engn Guangzhou 510006 Peoples R China Minist Educ Key Lab Pollut Control & Ecosyst Restorat Ind Clu Guangzhou 510006 Peoples R China Guangdong Regular Higher Educ Inst Key Lab Environm Protect & Eco Remediat Guangzhou 510006 Peoples R China

Wastewater-based epidemiology (WBE) has contributed significantly to the monitoring of drug use and transmission of viruses that has been published in numerous research papers. In this paper, we used LitStraw, a self-developed text extraction tool, to extract, analyze, and construct knowledge graphs from nearly 900 related papers in PDF format collected in Web of Science from 2000 to 2021 to analyze the research hotspots and development trends of WBE. The results showed a growing number of WBE publications in multidisciplinary cross-collaboration, with more publications and close collaboration between the USA, Australia, China, and European countries. The keywords of illicit drugs and pharmaceuticals still maintain research hotness, but the specific research hotspots change significantly, among which the research hotspots of new psychoactive substances, biomarkers, and stability show an increasing trend. In addition, judging the spread of COVID-19 by the presence of SARS-CoV-2 RNA in sewage has become the focus since 2020. This work can show the development of WBE more clearly by constructing a knowledge graph and also provide new ideas for the paper mining analysis methods in different fields.

关键词： Wastewater-based epidemiology Knowledge graph Text extraction tool Paper mining analysis Development trends Research hotspots

来源：评论

学校读者我要写书评

暂无评论

Topological Descriptors on Some Families of graphs

引用

JOURNAL OF CHEMISTRY 2021年第1期2021卷

作者： Ahmad, Iftikhar Chaudhry, Maqbool Ahmad Hussain, Muhammad Mahmood, Tariq Univ Lahore Dept Math Lahore Pakistan COMSATS Univ Islamabad Dept Math Lahore Campus Lahore Pakistan Govt Coll Gujranwala Dept Math Gujranwala Pakistan

In view of the successful applications of graph theory, relationships between the biological activity and chemical structure have been developed. One of the popular topics in graph theory is problems relating to topological indices. Degree-based topological indices, distance-based topological indices, and counting-related topological indices are various types of topological indices. Physiochemical properties such as boiling point and stability of chemical compounds are correlated by these topological indices. A topological index of a graph is a numerical quantity obtained from the graph mathematically. A cactus graph is a connected graph in which no edge lies in more than one cycle. In this study, we have derived certain degree-based topological indices for some families of graphs consisting of graph obtained by the rooted product of paths and cycles and two types of cactus graph (paracactus and orthocactus) with the help of the generalized Zagreb index.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Weighted graphs defining facets: A connection between stable set and linear ordering polytopes

引用

DISCRETE OPTIMIZATION 2009年第1期6卷 1-9页

作者： Doignon, Jean-Paul Fiorini, Samuel Joret, Gwenael Univ Libre Bruxelles Dept Informat B-1050 Brussels Belgium Univ Libre Bruxelles Dept Math B-1050 Brussels Belgium

A graph is alpha-critical if its stability number increases whenever an edge is removed from its edge set. The class of alpha-critical graphs has several nice structural properties, most of them related to their defect which is the number of vertices minus two times the stability number. In particular, a remarkable result of Lovasz [L. Lovasz, Some finite basis theorems on graph theory, in: A. Hajnal, V.T. Sos (Eds.), Combinatorics (Proc. Fifth Hungarian Colloq., Keszthely, 1976), Vol. II, in: Colloquia Mathematica Societatis Janos Bolyai, vol. 18, North-Holland, Amsterdam, 1978, pp. 717-729] is the finite basis theorem for alpha-critical graphs of a fixed defect. The class of alpha-critical graphs is also of interest for at least two topics of polyhedral studies. First, Chvatal [V. Chvatal, On certain polytopes associated with graphs, journal of Combinatorial Theory Ser. B 18 (1975) 138-154] shows that each alpha-critical graph induces a rank inequality which is facet-defining for its stable set polytope. Investigating a weighted generalization, Liptak and Lovasz [L.. Liptak, L Lovasz, Facets with fixed defect of the stable set polytope, Mathematical Programming 88 (Set. A) (2000) 33-44;L. Liptak, L Lovasz, Critical facets of the stable set polytope, Combinatorica 21 (2001) 61-88] introduce critical facet-graphs (which again produce facet-defining inequalities for their stable set polytopes) and they establish a finite basis theorem. Second, Koppen [M. Koppen, Random utility representation of binary choice probabilities: Critical graphs yielding critical necessary conditions, journal of Mathematical Psychology 39 (1995) 21-39] describes a construction that delivers from any alpha-critical graph a facet-defining inequality for the linear ordering polytope. Doignon et al. [J.-P. Doignon, S. Fiorini, G. Joret, Facets of the linear ordering polytope: A unification for the fence family through weighted graphs, journal or Mathematical Psychology 50 (3) (2006) 251-262] ha

关键词： alpha-critical graphs Stable set polytope Linear ordering polytope

来源：评论

学校读者我要写书评

暂无评论

Special issue on stability in graphs and related topics

Special issue on stability in graphs and related topics

引用

stability in graphs and related topics

作者： Lozin, Vadim De, Werra, Dominique RUTCOR Rutgers University 640 Bartholomew Rd. Piscataway NJ 08854-8003 United States Mathematics Department EPFL CH-1015 Lausanne Switzerland

来源：评论

学校读者我要写书评

暂无评论

Special issue on stability in graphs and related topics

引用

DISCRETE APPLIED MATHEMATICS 2003年第1-3期132卷 1-2页

作者： Lozin, V de Werra, D Rutgers State Univ RUTCOR Piscataway NJ 08854 USA EPFL Dept Math CH-1015 Lausanne Switzerland

来源：评论

学校读者我要写书评

暂无评论

Equistable chordal graphs

Equistable chordal graphs

引用

stability in graphs and related topics

作者： Peled, Uri N. Rotics, Udi University of Illinois at Chicago 851 South Morgan Street Chicago IL 60607-7045 United States Sch. of Math. and Computer Science Netanya Academic College Netanya 42365 Israel

An equistable chordal graphs were discussed. It was shown that a chordal graph was equistable if and only if every two adjacent non-simplicial vertices have a common simplicial neighbor. The threshold graphs were also... 详细信息

关键词： Graph theory

来源：评论

学校读者我要写书评

暂无评论

Independence and upper irredundance in claw-free graphs

Independence and upper irredundance in claw-free graphs

引用

stability in graphs and related topics

作者： Favaron, Odile LRI Bât. 490 Université de Paris-Sud 91405 Orsay Cedex France

It is known that the independence number of a connected claw-free graph G of order n is at most (n + 1)/2. We improve this result by showing that this bound still holds for the upper irredundance number IR(G). We characterize the connected claw-free graphs for which IR(G) = (n + 1)/2 and give some properties of those graphs for which IR(G) = n/2 if n is even or IR(G) = (n - 1)/2 if n is odd. © 2003 Elsevier B.V. All rights reserved.

关键词： Graph theory

来源：评论

学校读者我要写书评

暂无评论

Equistable series-parallel graphs

Equistable series-parallel graphs

引用

stability in graphs and related topics

作者： Korach, Ephraim Peled, Uri N. Dept. of Indust. Eng. and Management Ben-Gurion University of the Negev P.O. Box 653 Beer-Sheva 84105 Israel University of Illinois at Chicago 851 S. Morgan Street Chicago IL 60607-7045 United States

An equistable series-parallel graphs were characterized. A graph was called equistable when there was a non-negative weight function in its vertices such that a set S of vertices has total weight 1 if and only if S wa... 详细信息

关键词： Graph theory

来源：评论

学校读者我要写书评

暂无评论

Some results on maximum stable sets in certain P5-free graphs

Some results on maximum stable sets in certain P5-free graph...

引用

stability in graphs and related topics

作者： Mosca, Raffaele Dipartimento di Scienze Univ. degli Studi G. D'Annunzio Viale Pindaro 42 Pescara 65127 Italy

We introduce some large classes of P5-free graphs for which the maximum stable set problem can be efficiently solved. The solution algorithms are based on the search of augmenting vertices. Then a method for extending... 详细信息

关键词： Graph theory

来源：评论

学校读者我要写书评

暂无评论

Induced matchings in asteroidal triple-free graphs

Induced matchings in asteroidal triple-free graphs

引用

stability in graphs and related topics

作者： Chang, Jou-Ming Department of Information Management National Taipei College of Business Taipei Taiwan

An induced matching M of a graph G is a set of pairwise nonadjacent edges such that no two edges of M are joined by an edge in G. The problem of finding a maximum induced matching is known to be NP-hard even for bipartite graphs of maximum degree four. In this paper, we study the maximum induced matching problem on classes of graphs related to AT-free graphs. We first define a wider class of graphs called the line-asteroidal triple-free (LAT-free) graphs which contains AT-free graphs as a subclass. By examining the square of line graph of LAT-free graphs, we give a characterization of them and apply this for showing that the maximum induced matching problem and a generalization, called the maximum δ-separated matching problem, on LAT-free graphs can be solved in polynomial time. In fact, our result can be extended to the classes of graphs with bounded asteroidal index. Next, we propose a linear-time algorithm for finding a maximum induced matching in a bipartite permutation (bipartite AT-free) graph using the greedy approach. Moreover, we show that using the same technique the minimum chain subgraph cover problem on bipartite permutation graphs can be solved with the same time complexity. © 2003 Elsevier B.V. All rights reserved.

关键词： Graph theory

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：