Results 51 to 60 of about 14,658 (182)
Sparse Graphs With Local Covering Conditions on Edges
Journal of Graph Theory, EarlyView.ABSTRACT In 1988, Erdős suggested the question of minimizing the number of edges in a connected n $n$‐vertex graph where every edge is contained in a triangle. Shortly after, Catlin, Grossman, Hobbs, and Lai resolved this in a stronger form. In this paper, we study a natural generalization of the question of Erdős in which we replace “triangle” with ...
Debsoumya Chakraborti +3 more
wiley +1 more source
On Planar Supports for Hypergraphs
Journal of Graph Algorithms and Applications, 2011 A graph G is a support for a hypergraph H = (V, S) if the vertices of G correspond to the vertices of H such that for each hyperedge Si ∈ S the subgraph of G induced by Si is connected. G is a planar support if it is a support and planar.
Kevin Buchin +4 more
doaj +1 more source
Saturated Partial Embeddings of Planar Graphs
Journal of Graph Theory, EarlyView.ABSTRACT In this work, we study how far one can deviate from optimal behavior when embedding a planar graph. For a planar graph G $G$, we say that a plane subgraph H ⊆ G $H\subseteq G$ is a plane‐saturated subgraph if adding any edge (possibly with new vertices) to H $H$ would either violate planarity or make the resulting graph no longer a subgraph of
Alexander Clifton, Nika Salia
wiley +1 more source
, 2021 Artificial intelligence (AI) based drug design has demonstrated great potential to fundamentally change the pharmaceutical industries. Currently, a key issue in AI-based drug design is efficient transferable molecular descriptors or fingerprints.
Xia, Kelin
core +1 more source
IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing, 2023 Cross-modal remote sensing (RS) image retrieval aims to retrieve RS images using other modalities (e.g., text) and vice versa. The relationship between objects in the RS image is complex, i.e., the distribution of multiple types of objects is uneven ...
Fanglong Yao +6 more
doaj +1 more source
Equivalent Formulation of Thomassen's Conjecture Using Tutte Paths in Claw‐Free Graphs
Journal of Graph Theory, EarlyView.ABSTRACT We continue studying Thomassen's conjecture (every 4‐connected line graph has a Hamilton cycle) in the direction of a recently shown equivalence with Jackson's conjecture (every 2‐connected claw‐free graph has a Tutte cycle), and we extend the equivalent formulation as follows: In every connected claw‐free graph, any two vertices are connected
Adam Kabela +2 more
wiley +1 more source
From Finding a Spanning Subgraph H $H$ to an H $H$‐Factor
Journal of Graph Theory, EarlyView.ABSTRACT A typical Dirac‐type problem in extremal graph theory is to determine the minimum degree threshold for a graph G $G$ to have a spanning subgraph H $H$, for example, the Dirac theorem. A natural follow‐up problem is to seek an H $H$‐factor, which is a spanning set of vertex‐disjoint copies of H $H$.
Allan Lo
wiley +1 more source
Generalized strong intuitionstic fuzzy hypergraph [PDF]
, 2014 In this paper, we have generalized the concept of intuitionistic fuzzy hypergraph, strong intuitionistic fuzzy hypergraph by considering intuitionistic fuzzy vertex instead of crisp vertex set and interrelations between intuitionistic fuzzy vertices and ...
Samanta T.K. +3 more
core +1 more source
Hyperbolic multi-channel hypergraph convolutional neural network based on multilayer hypergraph
Scientific ReportsIn recent years, hypergraph neural networks have achieved remarkable success in tasks such as node classification, link prediction, and graph classification, thanks to their powerful computational capabilities.
Libing Bai +4 more
doaj +1 more source
Computer Science Journal of Moldova, 1993 We introduce the notion of an anti-edge of a hypergraph, which is a non-overall polychromatic subset of vertices. The maximal number of colors, for which there exists a coloring of a hypergraph using all colors, is called an upper chromatic number of a ...
V. Voloshin
doaj