Results 141 to 150 of about 2,876,957 (249)

Some properties of the cycle graph of complete graphs and complete bipartite graphs

, 2001
This paper is an exposition of the article entitled Cycle Graph taken from the journal Transactions of the National Academy of Science and Technology , vol. VI (1984) by Dr. Severino V. Gervacio.
Resoso, Melvin Z., Tan, Philip Anthony C.   +1 more
core  

Adversarially Regularized Dynamic Graph Embeddings for Robust Community Evolution and Threat Detection in OSN

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, Ashish Dibouliya, Antonio González‐Torres, Ranjana Sikarwar, A. Samson Arun Raj, Yagyanath Rimal   +5 more
wiley   +1 more source

Parallel O(log(n)) time edge-colouring of trees and Halin graphs [PDF]

We present parallel O(log(n))-time algorithms for optimal edge colouring of trees and Halin graphs with n processors on a a parallel random access machine without write conflicts (P-RAM).
Gibbons, Alan (Alan M.), Israeli, Amos, Rytter, Wojciech   +2 more
core  

Polyhedral Graphs of GRAPH PARTITIONING and COMPLETE BIPARTITE SUBGRAPH Problems

, 2015
We provide an effective description of graphs of polyhedra for GRAPH PARTITIONING and COMPLETE BIPARTITE SUBGRAPH problems. We establish the fact, that the clique number for each of this problems increases exponentially with the dimension of the ...
V. A. Bondarenko, A. I. Antonov
core   +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 ) Stefanie Gerke, Gregory Gutin, Anders Yeo, Yacong Zhou   +3 more
wiley   +1 more source

Hitting Times in the Binomial Random Graph

Journal of Graph Theory, Volume 113, Issue 2, Page 377-393, October 2026.
ABSTRACT Fix k ≥ 2 , choose log n n ( k − 1 ) ∕ k ≤ p ≤ 1 − Ω ( log 4 n n ) Bertille Granet, Felix Joos, Jonathan Schrodt   +2 more
wiley   +1 more source

On the Hardness of Switching to a Small Number of Edges

Journal of Graph Theory, Volume 113, Issue 2, Page 237-251, October 2026.
ABSTRACT Seidel's switching is a graph operation which makes a given vertex adjacent to precisely those vertices to which it was non‐adjacent before, while keeping the rest of the graph unchanged. Two graphs are called switching‐equivalent if one can be made isomorphic to the other one by a sequence of switches. Jelínková et al. [DMTCS 13, no. 2, 2011]
Vít Jelínek, Eva Jelínková, Jan Kratochvíl   +2 more
wiley   +1 more source

Robustness of the Sauer–Spencer Theorem

Random Structures &Algorithms, Volume 69, Issue 3, October 2026.
ABSTRACT We prove a robust version of a graph embedding theorem of Sauer and Spencer. To state this sparser analogue, we define G(p)$$ G(p) $$ to be a random subgraph of G$$ G $$ obtained by retaining each edge of G$$ G $$ independently with probability p∈[0,1]$$ p\in \left[0,1\right] $$, and let m1(H)$$ {m}_1(H) $$ be the maximum 1‐density of a graph ...
Peter Allen, Julia Böttcher, Yoshiharu Kohayakawa, Mihir Neve   +3 more
wiley   +1 more source

On the Local Resilience of Random Geometric Graphs With Respect to Connectivity and Long Cycles

Random Structures &Algorithms, Volume 69, Issue 3, October 2026.
ABSTRACT Given an increasing graph property 𝒫, a graph G$$ G $$ is α$$ \alpha $$‐resilient with respect to 𝒫 if, for every spanning subgraph H⊆G$$ H\subseteq G $$ where each vertex keeps more than a (1−α)$$ \left(1-\alpha \right) $$‐proportion of its neighbors, H$$ H $$ has property 𝒫.
Alberto Espuny Díaz, Lyuben Lichev, Alexandra Wesolek   +2 more
wiley   +1 more source

Ethnic integration and the value of innovation

Strategic Management Journal, Volume 47, Issue 10, Page 2792-2820, October 2026.
Abstract Research Summary Organizations have become increasingly ethnically diverse, and this diversity often brings together distinct technological competencies. Understanding how firms can leverage such diversity to produce valuable innovations therefore becomes essential.
Stefano Breschi, Luisa Gagliardi, Thomas Yoon   +2 more
wiley   +1 more source