Results 101 to 110 of about 140,780 (247)

A new beef: An analysis of discourse coalitions in the nascent cellular agriculture policy subsystem

Review of Policy Research, EarlyView.
Abstract A robust approach to examining the nature and influence of coalitions in the policy process is the Advocacy Coalition Framework (ACF), which is especially useful to study policy issues fraught with scientific and technical controversy. Yet, important gaps exist in ACF literature regarding nascent policy subsystems. Consequently, there is scant
Nikki Nadeau, Ramiro Berardo
wiley   +1 more source

Complexity of Join and Corona graphs and Chebyshev polynomials

Journal of Taibah University for Science, 2018
Boesh and Prodinger have shown how to use properties of Chebyshev polynomials to compute formulas for the number of spanning trees of some special graphs.
S. N. Daoud
doaj   +1 more source

Girth in GF(q)$\textsf {GF}(q)$‐representable matroids

Bulletin of the London Mathematical Society, EarlyView.
Abstract We prove a conjecture of Geelen, Gerards, and Whittle that for any finite field GF(q)$\textsf {GF}(q)$ and any integer t$t$, every cosimple GF(q)$\textsf {GF}(q)$‐representable matroid with sufficiently large girth contains either M(Kt)$M(K_t)$ or M(Kt)∗$M(K_t)^*$ as a minor.
James Davies, Meike Hatzel, Kolja Knauer, Rose McCarty, Torsten Ueckerdt   +4 more
wiley   +1 more source

Algebraic Connectivity Maximizing Regular Graphs: Special Case Analysis and Depth‐First Search

Concurrency and Computation: Practice and Experience, Volume 37, Issue 27-28, 25 December 2025.
ABSTRACT The algebraic connectivity is an indicator of how well connected a graph is. It also characterizes the convergence speed of some dynamic processes over networks. In this paper, taking into account that homogeneous networks are modeled as regular graphs, we tackle the following problem: given a pair (n,k)$$ \left(n,k\right) $$ of positive ...
Masashi Kurahashi, Najd Salaani, Tsuyoshi Migita, Norikazu Takahashi   +3 more
wiley   +1 more source

MATCHING AND EDGE COVERING NUMBER ON STRONG PRODUCT OF COMPLETE BIPARTITE GRAPHS [PDF]

, 2014
Thanin Sitthiwirattham
openalex   +1 more source

Completing Partial k‐Star Designs

Journal of Combinatorial Designs, Volume 33, Issue 12, Page 446-455, December 2025.
ABSTRACT A k‐star is a complete bipartite graph K 1 , k. A partial k‐star design of order n is a pair ( V , A ) where V is a set of n vertices and A is a set of edge‐disjoint k‐stars whose vertex sets are subsets of V. If each edge of the complete graph with vertex set V is in some star in A, then ( V , A ) is a (complete) k‐star design.
Ajani De Vas Gunasekara, Daniel Horsley
wiley   +1 more source

A Systematic Overview of Caching Mechanisms to Improve Hadoop Performance

Concurrency and Computation: Practice and Experience, Volume 37, Issue 25-26, 30 November 2025.
ABSTRACT In today's distributed computing environments, the rapid generation of large‐scale data from diverse sources poses significant challenges in terms of storage, management, and processing, particularly for traditional relational databases. Hadoop has emerged as a widely adopted framework for handling such data through parallel processing across ...
Rana Ghazali, Douglas G. Down
wiley   +1 more source

Spanning Plane Subgraphs of 1‐Plane Graphs

Journal of Graph Theory, Volume 110, Issue 3, Page 290-297, November 2025.
ABSTRACT A graph drawn on the plane is called 1‐plane if each edge is crossed at most once by another edge. In this paper, we show that every 4‐edge‐connected 1‐plane graph has a connected spanning plane subgraph. We also show that there exist infinitely many 4‐connected 1‐plane graphs that have no 2‐connected spanning plane subgraphs.
Kenta Noguchi, Katsuhiro Ota, Yusuke Suzuki   +2 more
wiley   +1 more source

Connectivity and Hamiltonicity of Canonical Colouring Graphs of Bipartite and Complete Multipartite Graphs [PDF]

, 2018
Ruth Haas, Gary MacGillivray
openalex   +1 more source

Bipartite Digraphs with Modular Concept Lattices of height 2

Қарағанды университетінің хабаршысы. Математика сериясы
This paper investigates the interaction between Formal Concept Analysis (FCA) and graph theory, with a focus on understanding the structure and representation of concept lattices derived from bipartite directed graphs.
A.O. Basheyeva, A.T. Zhussupova, Y.K. Nurlibayev   +2 more
doaj   +1 more source