Results 41 to 50 of about 3,103 (144)
Energy Science &Engineering, Volume 12, Issue 7, Page 2899-2917, July 2024.Relationship between inorganic minerals, pore structure parameters, and fractal dimension. Abstract To quantitatively characterize the complexity of shale pore structures and their controlling factors in the Longmaxi Formation of Western Hubei, our study focused on the organic‐rich shale outcrops of the Longmaxi Formation in the Yidu‐Hefeng compound ...
Zongbao Diao, Feifei Huo, Pengfei Li
wiley +1 more source
The t/k-diagnosability and strong Menger connectivity on star graphs with conditional faults
Theoretical Computer Science, 2019 The t / k -diagnosis, a famous diagnosis strategy, is proposed by Somani and Peleg. In this strategy, all the faulty vertices, no more than t, can be isolated into a faulty set, which may contain no more than k fault-free vertices. Somani and Peleg ( [16]
Pingshan Li, Min Xu
semanticscholar +1 more source
Critical geoeconomics: A genealogy of writing politics, economy and space
Transactions of the Institute of British Geographers, Volume 49, Issue 1, March 2024.Short Abstract The notion of geoeconomics became increasingly popular since the 1990s. Conventionally treated as a neologism, attributed to the strategist Edward N. Luttwak, earlier iterations of geoeconomics, some dating back more than a century, have been ignored by both celebratory and critical accounts.
Felix Mallin, James D. Sidaway
wiley +1 more source
Directed Minors III. Directed Linked Decompositions [PDF]
, 2014 Thomas proved that every undirected graph admits a linked tree decomposition of width equal to its treewidth. In this paper, we generalize Thomas's theorem to digraphs.
Kintali, Shiva
core
Ramified rectilinear polygons: coordinatization by dendrons
, 2010 Simple rectilinear polygons (i.e. rectilinear polygons without holes or cutpoints) can be regarded as finite rectangular cell complexes coordinatized by two finite dendrons.
A Dress +33 more
core +3 more sources
Evaluating Connection Resilience for the Overlay Network Kademlia
, 2017 Kademlia is a decentralized overlay network, up to now mainly used for highly scalable file sharing applications. Due to its distributed nature, it is free from single points of failure.
Heck, Henner +2 more
core +1 more source
Edge‐Connectivity Between Edge‐Ends of Infinite Graphs [PDF]
Journal of Graph TheoryIn infinite graph theory, the notion of ends, first introduced by Freudenthal and Jung for locally finite graphs, plays an important role when generalizing statements from finite graphs to infinite ones.
L. Aurichi, L. Real
semanticscholar +1 more source
A spectral lower bound for the divisorial gonality of metric graphs [PDF]
, 2014 Let $\Gamma$ be a compact metric graph, and denote by $\Delta$ the Laplace operator on $\Gamma$ with the first non-trivial eigenvalue $\lambda_1$. We prove the following Yang-Li-Yau type inequality on divisorial gonality $\gamma_{div}$ of $\Gamma$. There
Amini, Omid, Kool, Janne
core
Structure of the Group of Balanced Labelings on Graphs, its Subgroups and Quotient Groups [PDF]
, 2013 We discuss functions from edges and vertices of an undirected graph to an Abelian group. Such functions, when the sum of their values along any cycle is zero, are called balanced labelings. The set of balanced labelings forms an Abelian group.
Cherniavsky, Yonah +2 more
core
Min-Max Theorems for Packing and Covering Odd $(u,v)$-trails
, 2017 We investigate the problem of packing and covering odd $(u,v)$-trails in a graph. A $(u,v)$-trail is a $(u,v)$-walk that is allowed to have repeated vertices but no repeated edges. We call a trail odd if the number of edges in the trail is odd.
A Schrijver +6 more
core +1 more source