Results 181 to 190 of about 3,842,374 (234)
Some of the next articles are maybe not open access.
The forcing edge fixed steiner number of a graph
Journal of Statistics and Management Systems, 2019Let G be a simple connected graph with at least 3 vertices and W be an edge fixed steiner set of G[6]. A subset T ⊆ W is called an edge fixed forcing subset for W if W is the unique Se – set containing T. In this paper, we introduce the parameter forcing
M. Perumalsamy +3 more
exaly +2 more sources
The forcing Edge Fixing Edge-to-Vertex Monophonic number of a Graph
Discrete Mathematics, Algorithms and Applications, 2013For a connected graph G = (V, E), a set Se ⊆ E(G)–{e} is called an edge fixing edge-to-vertex monophonic set of an edge e of a connected graph G if every vertex of G lies on an e – f edge-to-vertex monophonic path of G, where f ∈ Se. The edge fixing edge-to-vertex monophonic number mefev(G) of G is the minimum cardinality of its edge fixing edge-to ...
J. John, K. U. Samundesvari
semanticscholar +2 more sources
Plane Elementary Bipartite Graphs with Forcing or Anti-forcing Edges
Graphs and Combinatorics, 2019zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Zhongyuan Che, Zhibo Chen
exaly +2 more sources
Anti-forcing polynomials for benzenoid systems with forcing edges
Discrete Applied Mathematics, 2018zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Heping Zhang
exaly +2 more sources
Positive Zero Forcing and Edge Clique Coverings
Lecture Notes in Computer Science, 2016Zero forcing parameters, associated with graphs, have been studied for over a decade, and have gained popularity as the number of related applications grows. In this paper, we investigate positive zero forcing within the context of certain edge clique coverings. A key object considered here is the compressed cliques graph.
Shaun Fallat +2 more
exaly +2 more sources
Vortex simulation of leading-edge separation bubble with local forcing
A numerical study is made of the flow control of leading-edge separation bubbles in a two-dimensional semi-infinite blunt plate, which is aligned parallel to the main stream. A version of the discrete-vortex method is utilized.
Hyung Jin Sung, Masaru Kiya
exaly +1 more source
Acoustic Radiation Forces Produced by Sharp-Edge Structures in Microfluidic Systems.
Physical Review Letters, 2020We study sharp-edge structures that are used in microfluidic systems for particle and cell manipulation. Experiments show that oscillating sharp edges can attract or repel particles suspended in a microfluidic channel.
A. Doinikov, M. Gerlt, J. Dual
semanticscholar +1 more source
Area and edge effects in radiometric forces
Physical Review E, 2009The radiometric force on several configurations of heated plates placed in a stagnant gas is examined experimentally, with a high-resolution thrust stand, and numerically using the direct simulation Monte Carlo method and a discrete ordinate solution of a model kinetic equation.
Selden, N +5 more
openaire +3 more sources
A Distributed Algorithm for Force Directed Edge Bundling
2020 IEEE 10th Symposium on Large Data Analysis and Visualization (LDAV), 2020Existing edge bundling algorithms typically require the global information structure of a graph. Therefore, with a simple division of the edges of a graph, it is challenging to conduct edge bundling in a distributed environment and achieve scalable performance. We select a representative edge bundling algorithm, Force-Directed Edge Bundling (FDEB), and
Yves Tuyishime +2 more
openaire +1 more source
Force‐Directed Edge Bundling for Graph Visualization
Computer Graphics Forum, 2009AbstractGraphs depicted as node‐link diagrams are widely used to show relationships between entities. However, node‐link diagrams comprised of a large number of nodes and edges often suffer from visual clutter. The use of edge bundling remedies this and reveals high‐level edge patterns. Previous methods require the graph to contain a hierarchy for this,
Holten, D.H.R., Wijk, van, J.J.
openaire +2 more sources

