Results 1 to 10 of about 3,840,075 (194)
The upper edge geodetic number and the forcing edge geodetic number of a graph [PDF]
Opuscula Mathematica, 2009 An edge geodetic set of a connected graph \(G\) of order \(p \geq 2\) is a set \(S \subseteq V(G)\) such that every edge of \(G\) is contained in a geodesic joining some pair of vertices in \(S\).
A. P. Santhakumaran, J. John
doaj +3 more sources
Single coronoid systems with an anti-forcing edge
Discrete Applied Mathematics, 2017 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Heping Zhang
exaly +4 more sources
Forcing and anti-forcing edges in bipartite graphs
Discrete Applied Mathematics, 2018 Let G be a connected bipartite graph with a perfect matching and the minimum degree at least two. The concept of an anti-forcing edge in G was introduced by Li in Li (1997). One known generalized version for an anti-forcing edge is an anti-forcing set S ,
Zhongyuan Che, Zhibo Chen
exaly +4 more sources
Forcing edge detour monophonic number of a graph [PDF]
Transactions on Combinatorics, 2021 For a connected graph $G=(V,E)$ of order at least two, an edge detour monophonic set of $G$ is a set $S$ of vertices such that every edge of $G$ lies on a detour monophonic path joining some pair of vertices in $S$. The edge detour monophonic number
P. Titus, K. Ganesamoorthy
doaj +2 more sources
Hexagonal systems with forcing single edges
Discrete Applied Mathematics, 1997 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Xueliang Li
exaly +2 more sources
Optimizing large-scale graph database ingestion through edge value ranking: a proposed framework [PDF]
Frontiers in Big DataThis paper proposes a preprocessing framework for optimizing large-scale graph database ingestion through intelligent edge filtering based on value ranking. We combine adapted PageRank algorithms with business-specific metrics and edge type importance to
Phanindra Reddy Madduru, Bijo Thomas
doaj +2 more sources
Edge Forcing in Butterfly Networks [PDF]
Fundamenta Informaticae, 2021 A zero forcing set is a set $S$ of vertices of a graph $G$, called forced vertices of $G$, which are able to force the entire graph by applying the following process iteratively: At any particular instance of time, if any forced vertex has a unique unforced neighbor, it forces that neighbor.
G. Jessy Sujana +3 more
openaire +4 more sources
Vertex and edge spread of zero forcing number, maximum nullity, and minimum rank of a graph
Linear Algebra and Its Applications, 2012 Christina J Edholm, Leslie Hogben
exaly +2 more sources
The future of the El Niño–Southern Oscillation: using large ensembles to illuminate time-varying responses and inter-model differences [PDF]
Earth System Dynamics, 2023 Future changes in the El Niño–Southern Oscillation (ENSO) are uncertain, both because future projections differ between climate models and because the large internal variability of ENSO clouds the diagnosis of forced changes in observations and ...
N. Maher +11 more
doaj +1 more source
Remote Sensing, 2023 Extreme precipitation events have been occurring frequently worldwide, and their causative factors and convection initiation (CI) mechanisms have been attracting more and more attention in recent years.
Qi Sun +8 more
doaj +1 more source