Results 21 to 30 of about 8,313 (308)
Reconfiguring spanning and induced subgraphs [PDF]
Theoretical Computer Science, 2018 Subgraph reconfiguration is a family of problems focusing on the reachability of the solution space in which feasible solutions are subgraphs, represented either as sets of vertices or sets of edges, satisfying a prescribed graph structure property. Although there has been previous work that can be categorized as subgraph reconfiguration, most of the ...
Tesshu Hanaka +7 more
openaire +4 more sources
Groups for which the noncommuting graph is a split graph [PDF]
International Journal of Group Theory, 2017 The noncommuting graph $nabla (G)$ of a group $G$ is a simple graph whose vertex set is the set of noncentral elements of $G$ and the edges of which are the ones connecting two noncommuting elements. We determine here, up to isomorphism, the structure of
Marzieh Akbari, Alireza Moghaddamfar
doaj +1 more source
Induced subgraph and eigenvalues of some signed graphs
AKCE International Journal of Graphs and Combinatorics, 2022 Hao Huang proved the Sensitivity Conjecture in [Induced graphs of the hypercube and a proof of the Sensitivity Conjecture, Annals of Mathematics, 190 (2019), 949-955] by signed graph spectral method.
Fu-Tao Hu, Mei-Yu Sun
doaj +1 more source
Finding a heaviest vertex-weighted triangle is not harder than matrix multiplication [PDF]
, 2009 We show that a maximum-weight triangle in an undirected graph with n vertices and real weights assigned to vertices can be found in time O(n(omega) + n(2+o(1))), where omega is the exponent of the fastest matrix multiplication algorithm. By the currently
Lingas, Andrzej, +4 more
core +1 more source
Efficient Streaming Subgraph Isomorphism with Graph NeuralNetworks
, 2021 Queries to detect isomorphic subgraphs are important in graphbased data management. While the problem of subgraph isomorphism search has received considerable attention for the static setting of a single query, or a batch thereof, existing approaches do ...
Weidlich, Matthias +5 more
core +1 more source
Beyond Distributed Subgraph Detection: Induced Subgraphs, Multicolored Problems and Graph Parameters [PDF]
, 2022 Subgraph detection has recently been one of the most studied problems in the CONGEST model of distributed computing. In this work, we study the distributed complexity of problems closely related to subgraph detection, mainly focusing on induced subgraph ...
Nikabadi, Amir, Korhonen, Janne H.
core +1 more source
On induced subgraphs of the Hamming graph [PDF]
Journal of Graph Theory, 2020 AbstractIn connection with his solution of the Sensitivity Conjecture, Hao Huang (arXiv: 1907.00847, 2019) asked the following question: Given a graph with high symmetry, what can we say about the smallest maximum degree of induced subgraphs of with vertices, where denotes the size of the largest independent set in ?
openaire +2 more sources
Graphs in which every c edges that form a tree are chords of a common cycle
AKCE International Journal of Graphs and Combinatorics, 2020 Consider the k-connected graphs G in which every edges that form a particular type of induced subgraph must all be chords of a common cycle of G. Extending a few known partial results with and new results exploit the structure of the specified type of ...
Terry A. McKee
doaj +1 more source
Efficient Densest Subgraphs Discovery in Large Dynamic Graphs by Greedy Approximation
IEEE Access, 2023 Densest subgraph detection has become an important primitive in graph mining tasks when analyzing communities and detecting events in a wide range of application domains.
Tao Han
doaj +1 more source
Supervised chemical graph mining improves drug-induced liver injury prediction
iScience, 2023 Summary: Drug-induced liver injury (DILI) is the main cause of drug failure in clinical trials. The characterization of toxic compounds in terms of chemical structure is important because compounds can be metabolized to toxic substances in the liver ...
Sangsoo Lim +5 more
doaj +1 more source