Results 91 to 100 of about 6,576,413 (265)
Hereditary Equality of Domination and Exponential Domination in Subcubic Graphs
Discussiones Mathematicae Graph Theory, 2021 Let γ(G) and γe(G) denote the domination number and exponential domination number of graph G, respectively. Henning et al., in [Hereditary equality of domination and exponential domination, Discuss. Math. Graph Theory 38 (2018) 275–285] gave a conjecture:
Chen Xue-Gang, Wang Yu-Feng, Wu Xiao-Fei
doaj +1 more source
Excluding induced subgraphs II: extremal graphs
Discrete Applied Mathematics, 1993 This paper, the second one in a sequence of papers of the authors [for Part I see Random Struct. Algorithms 2, 55-71 (1991; Zbl 0763.05046); for Part III see Random Struct. Algorithms 3, 19-31 (1992; Zbl 0751.05041)], studies properties of classes of finite graphs not containing a fixed subgraph \(H\) as an induced subgraph.
Prömel, H.J., Steger, A.
openaire +2 more sources
A complex network perspective on brain disease
Biological Reviews, Volume 101, Issue 1, Page 364-399, February 2026.ABSTRACT If brain anatomy and dynamics have a complex network structure as it has become standard to posit, it is reasonable to assume that such a structure should play a key role not only in brain function but also in brain dysfunction. However, exactly how network structure is implicated in brain damage and whether at least some pathologies can be ...
David Papo, Javier M. Buldú
wiley +1 more source
Doubly Nonnegative and Semidefinite Relaxations for the Densest k-Subgraph Problem
Entropy, 2019 The densest k-subgraph (DkS) maximization problem is to find a set of k vertices with maximum total weight of edges in the subgraph induced by this set. This problem is in general NP-hard. In this paper, two relaxation methods for solving the DkS problem
Chuan-Hao Guo, Yuan Guo, Bei-Bei Liu
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
Algoritma matching bobot maskimum dalam graph bipartit komplit berboto [PDF]
, 1998 ABSTRAK Suatu matching dalam graph G adalah subgraph 1-regular pada G yang disebabkan oleh kumpulan dart pasangan garis yang tidak adjacent. Suatu matching merupakan matching maksimum bila matching tersebut mempunyai harga pokok maksimum. Matching dalam
Astuti , Yani Parti
core
On Multilevel Energy‐Based Fragmentation Methods
International Journal of Quantum Chemistry, Volume 126, Issue 3, January 30, 2026.We investigate the working equations of energy‐based fragmentation methods and present ML‐SUPANOVA, a Möbius‐inversion‐based multilevel fragmentation scheme that enables adaptive, quasi‐optimal truncations to efficiently approximate Born‐Oppenheimer potentials across hierarchies of electronic‐structure methods and basis sets.
James Barker +2 more
wiley +1 more source
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
Distributed SE(d) Formation Control of Multi‐Agent Systems Using Relative Measurements
International Journal of Robust and Nonlinear Control, Volume 36, Issue 1, Page 100-116, 10 January 2026.ABSTRACT This study develops a solution to the distributed SE(d) formation control problem of multi‐agent systems using only relative measurements between agents. In this problem, poses, that is, orientations and positions, of the agents are expected to achieve desired ones.
Chunlai Peng +4 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