Results 91 to 100 of about 59,275 (246)
A graph theoretical analysis of the number of edges in k-dense graphs
Electronic Journal of Graph Theory and Applications, 2016 Due to the increasing discovery and implementation of networks within all disciplines of life, the study of subgraph connectivity has become increasingly important.
Linda Eroh +4 more
doaj +1 more source
Divisive Algorithm Based on Node Clustering Coefficient for Community Detection
IEEE Access, 2020 This paper studies the relationship between the clustering coefficient of nodes and the community structure of the network. Communities in a network are regarded as node-induced subgraphs of the network in this study.
Qingbin Ji, Deyu Li, Zhen Jin
doaj +1 more source
On the number of induced subgraphs of trees
Discrete Mathematics, 1997 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
On coloring digraphs with forbidden induced subgraphs
Journal of Graph Theory, 2022 AbstractWe prove a conjecture by Aboulker, Charbit, and Naserasr by showing that every oriented graph in which the out‐neighborhood of every vertex induces a transitive tournament can be partitioned into two acyclic induced subdigraphs. We prove multiple extensions of this result to larger classes of digraphs defined by a finite list of forbidden ...
openaire +3 more sources
Computer-Aided Civil and Infrastructure Engineering, EarlyView.Abstract Road networks face increasing disruptions, yet vulnerability assessment methods either oversimplify traffic dynamics or require extensive computational simulations. This research introduces a novel approach integrating traffic simulation, graph theory, and machine learning for efficient and accurate vulnerability assessment.
Abdel Rahman Marian +2 more
wiley +1 more source
The Phylogeny Graphs of Doubly Partial Orders
Discussiones Mathematicae Graph Theory, 2013 The competition graph of a doubly partial order is known to be an interval graph. The CCE graph and the niche graph of a doubly partial order are also known to be interval graphs if the graphs do not contain a cycle of length four and three as an induced
Park Boram, Sano Yoshio
doaj +1 more source
Computer-Aided Civil and Infrastructure Engineering, EarlyView.Abstract This paper proposes a fully automated end‐to‐end inspection‐path‐planning strategy for underground utilities, such as pipelines, based on building information modeling (BIM). An automatic extraction method is developed to process utility information from BIM models, using a registration step that pairs each pipeline with its corresponding ...
Zihan Yang +6 more
wiley +1 more source
The graph grabbing game on {0,1}-weighted graphs
Results in Applied Mathematics, 2019 The graph grabbing game is a two-player game on a weighted connected graph in which two players, Alice and Bob, alternatively remove non-cut vertices one by one to gain the weights on them.
Soogang Eoh, Jihoon Choi
doaj +1 more source
A general framework on conditions for constraint‐based causal learning
Scandinavian Journal of Statistics, EarlyView.Abstract Most constraint‐based causal learning algorithms provably return the correct causal graph under certain correctness conditions, such as faithfulness. By representing any constraint‐based causal learning algorithm using the notion of a property, we provide a general framework to obtain and study correctness conditions for these algorithms. From
Kai Z. Teh, Kayvan Sadeghi, Terry Soo
wiley +1 more source
Indiscernibles in monadically NIP theories
Bulletin of the London Mathematical Society, EarlyView.Abstract We prove various results around indiscernibles in monadically NIP theories. First, we provide several characterizations of monadic NIP in terms of indiscernibles, mirroring previous characterizations in terms of the behavior of finite satisfiability. Second, we study (monadic) distality in hereditary classes and complete theories.
Samuel Braunfeld, Michael C. Laskowski
wiley +1 more source