Results 101 to 110 of about 11,781 (210)

A new family of solutions for graph‐restricted cooperative games: rethinking the weight of intermediary power

International Transactions in Operational Research, Volume 33, Issue 3, Page 1656-1677, May 2026.
Abstract In graph‐restricted cooperative games, a group of agents, represented by the nodes of a graph, work together to make a profit. However, two agents can cooperate within a coalition only if they are connected by the graph in the coalition. Several allocation rules have been proposed for these games, but there is something in common in all of ...
Antonio C. Alarcón, José M. Gallardo, Andrés Jiménez‐Losada   +2 more
wiley   +1 more source

Ore‐Type Conditions for Existence of a Jellyfish in a Graph

Journal of Graph Theory, Volume 111, Issue 4, Page 124-143, April 2026.
ABSTRACT The famous Dirac's theorem states that for each n ≥ 3 every n‐vertex graph G with minimum degree δ ( G ) ≥ n / 2 has a Hamiltonian cycle. When δ ( G ) < n / 2, this cannot be guaranteed, but the existence of some other specific subgraphs can be provided.
Jaehoon Kim, Alexandr Kostochka, Ruth Luo   +2 more
wiley   +1 more source

Recoloring via Modular Decomposition

Journal of Graph Theory, Volume 111, Issue 4, Page 113-123, April 2026.
ABSTRACT The reconfiguration graph of the k‐colorings of a graph G, denoted R k ( G ), is the graph whose vertices are the k‐colorings of G and two colorings are adjacent in R k ( G ) if they differ in color on exactly one vertex. A graph G is said to be recolorable if R ℓ ( G ) is connected for all ℓ ≥ χ ( G ) + 1.
Manoj Belavadi, Kathie Cameron, Ni Luh Dewi Sintiari   +2 more
wiley   +1 more source

Tractable but Hard to Approximate: The Bi‐Objective Minimum s$$ s $$‐t$$ t $$‐Cut Problem With Binary Capacities

Networks, Volume 87, Issue 3, Page 312-321, April 2026.
ABSTRACT The minimum s$$ s $$‐t$$ t $$‐cut problem is one of the most‐studied problems in discrete optimization and has a unique complexity status in multi‐objective optimization. Even though the single‐objective version of the problem can be solved in polynomial time, it has been shown in the seminal work of Papadimitriou and Yannakakis (2000) that ...
Jan Boeckmann, Stephan Helfrich, Oliver Bachtler, Stefan Ruzika, Clemens Thielen   +4 more
wiley   +1 more source

Randomly $C_{n} cup C_{m}$ graphs

Annales Universitatis Paedagogicae Cracoviensis: Studia Mathematica, 2007
A graph $G$ is said to be a randomly $H$ graph if and only if any subgraph of $G$ without isolated vertices, which is isomorphic to a subgraph of $H$, can be extended to a subgraph $F$ of $G$ such that $F$ is isomorphic to $H$.
Pavel Híc, Milan Pokorný
doaj  

Mining contextually meaningful subgraphs from a vertex-attributed graph

BMC Bioinformatics
Networks have emerged as a natural data structure to represent relations among entities. Proteins interact to carry out cellular functions and protein-Protein interaction network analysis has been employed for understanding the cellular machinery ...
Riyad Hakim, Saeed Salem
doaj   +1 more source

Subgraph Mining

, 2005
The amount of available data is increasing very fast. With this data the desire for data mining is also growing. More and larger databases have to be searched to find interesting (and frequent) elements and connections between them. Most often, the data of interest is very complex.
Fischer, Ingrid, Meinl, Thorsten
openaire   +2 more sources

Chromatic number and regular subgraphs

Bulletin of the London Mathematical Society, Volume 58, Issue 4, April 2026.
Abstract In 1992, Erdős and Hajnal posed the following natural problem: Does there exist, for every r∈N$r\in \mathbb {N}$, an integer F(r)$F(r)$ such that every graph with chromatic number at least F(r)$F(r)$ contains r$r$ edge‐disjoint cycles on the same vertex set? We solve this problem in a strong form, by showing that there exist n$n$‐vertex graphs
Barnabás Janzer, Raphael Steiner, Benny Sudakov   +2 more
wiley   +1 more source

A Biophysical Approach to the Design of Networks of Communication Systems

Mathematical Methods in the Applied Sciences, Volume 49, Issue 5, Page 4539-4547, 30 March 2026.
ABSTRACT Inspired by the growth dynamics of the protist Physarum polycephalum, we employ a formalism that describes adaptive, incompressible Hagen‐Poiseuille flows on channel networks to identify graphs connecting different nodes within Euclidean space. These graphs are either suboptimal or optimal relative to their length.
Rodrigo Almeida, Ana Filipa Valente, Rui Dilão   +2 more
wiley   +1 more source

Ultra‐Efficient 0.1 V cm Lithium Niobate Modulator with >$\gt$ 200 GHz Bandwidth Using a High‐Permittivity Bragg Waveguide

Advanced Photonics Research, Volume 7, Issue 3, March 2026.
This work demonstrates thin‐film lithium niobate Mach–Zehnder modulators. One of these modulators achieves a voltage‐length product of 0.1 V cm, a driving voltage of 1 V, a device length of 1 mm, and a bandwidth exceeding 200 GHz. A high‐permittivity cladded Bragg grating waveguide is utilized to enhance modulation efficiency, enabling low‐voltage and ...
Zobeyde Dadkhah, Reza Safian, Zaker Hossein Firouzeh   +2 more
wiley   +1 more source