Results 141 to 150 of about 2,715,030 (252)
Resolving Edge Colorings: Exact Results and a Tabu Search Heuristic
International Journal of Mathematics and Mathematical SciencesThis study presents new results on resolving edge colorings in graphs, a concept introduced by V. Saenpholphat and P. Zhang in 2003. We determine the resolving edge chromatic number for several well-known families of graphs, including complete graphs ...
Narjes Sabeghi +3 more
doaj +1 more source
Modeling Logical Interdependencies: Quantifying Systemic Risk From Rule‐Governed Actions
Risk Analysis, Volume 46, Issue 11, November 2026.ABSTRACT Systemic risk in critical infrastructure is often analyzed through physical, geographic, and cyber interdependencies. Yet infrastructures are also interdependent through the governing rules that organize human action. These rule‐mediated connections are a form of logical interdependency, and breakdowns in rule‐governed action can create ...
Sukrati Gautam +7 more
wiley +1 more source
Star Decompositions of Bipartite Graphs [PDF]
, 2015 In Chapter 1, we will introduce the definitions and the notations used throughout this thesis. We will also survey some prior research pertaining to graph decompositions, with special emphasis on star-decompositions and decompositions of bipartite graphs.
Lim, Jin Sean, Lim, Nick Jin Sean
core
Transactions in GIS, Volume 30, Issue 7, November 2026.ABSTRACT Digital elevation models (DEMs) are widely used to characterize terrain and support applications ranging from geomorphology to environmental management. While traditional analyses rely on handcrafted geomorphometric features, advances in machine learning enable richer, data‐driven representations of topographic surfaces.
Thomas Schneidergruber, Johannes Scholz
wiley +1 more source
Sharp Choice Number Thresholds for Complete Bipartite Graphs
AxiomsFix m≥3. The choice number ch(Km,n) of the complete bipartite graph Km,n has two sharp thresholds as n grows. We give complete proofs of the Hoffman–Johnson values at levels m+1 and m, and we pin down the extremal list assignments at the lower threshold ...
Julian Allagan +4 more
doaj +1 more source
Two Self‐Stabilizing Algorithms for the Maximal Pentagon Partitioning Problem
Concurrency and Computation: Practice and Experience, Volume 38, Issue 19, October 2026.ABSTRACT Given an undirected graph G=(V,E)$$ G=\left(V,E\right) $$, a collection of disjoint subsets of nodes π={V1,…,Vk}(V=V1∪⋯∪Vk)$$ \pi =\left\{{V}_1,\dots, {V}_k\right\}\kern0.3em \left(V={V}_1\cup \cdots \cup {V}_k\right) $$ is called a pentagon partition if each subset Vi(1≤i≤k)$$ {V}_i\kern0.3em \left(1\le i\le k\right) $$ satisfies one of the ...
Tota Yamada +2 more
wiley +1 more source
Ecology and Evolution, Volume 16, Issue 10, October 2026.We present the largest tropical tri‐trophic plant–gall–parasitoid network documented to date, assembled from lowland rainforest in Papua New Guinea. The network reveals strikingly high specialisation, in addition to gall traits such as apparency shaping parasitoid richness.
Philip T. Butterill +5 more
wiley +1 more source
On covering graphs by complete bipartite subgraphs
, 2007 We prove that, if a bipartite graph with e edges contains n vertex-disjoint edges, then n²/e complete bipartite subgraphs are necessary to cover all its edges. Similar lower bounds are also proved for fractional covers.
S. Jukna, A. S. Kulikov
core
Engineering Reports, Volume 8, Issue 10, October 2026.An adversarially regularized, carbon‐aware dynamic graph framework enables robust threat detection in evolving social networks by integrating temporal embeddings, community tracking, and sequential threat profiling. The approach achieves ∼95%–96% accuracy while reducing training energy consumption by 40%–45%, supporting scalable real‐world deployment ...
Romil Rawat +5 more
wiley +1 more source
Lower Bounds for Maximum Weight Bisections of Weighted Triangle‐Free Subcubic Graphs
Journal of Graph Theory, Volume 113, Issue 2, Page 252-273, October 2026.ABSTRACT A bisection of a graph is a cut in which the number of vertices in the two parts of the cut differ by at most 1. In this paper, we consider maximum weight bisections of edge‐weighted triangle‐free subcubic graphs and show that every weighted triangle‐free subcubic graph G = ( V , E , w )
wiley +1 more source