Results 111 to 120 of about 2,876,957 (249)

Generalized Matching Preclusion in Bipartite Graphs

Theory and Applications of Graphs, 2018
The matching preclusion number of a graph with an even number of vertices is the minimum number of edges whose deletion results in a graph that has no perfect matchings. For many interconnection networks, the optimal such sets are precisely sets of edges
Zachary Wheeler, Eddie Cheng, Dana Ferranti, Laszlo Liptak, Karthik Nataraj   +4 more
doaj   +1 more source

Geometry‐Aware Alignment and Comparison of Hierarchical Morse Complexes with Applications

Computer Graphics Forum, EarlyView.
Abstract Scalar fields derived from 3D X‐ray CT scans of samples undergoing ex situ processes, such as thermal aging, chemical etching, or mechanical stress, pose unique challenges for characterizing similarities and differences across acquisitions. Typically, a sample A (source) is imaged, removed, and subjected to experimental conditions that alter ...
Aniketh Venkat, Attila Gyulassy, Peer‐Timo Bremer, Valerio Pascucci   +3 more
wiley   +1 more source

On Paths in a Complete Bipartite Geometric Graph

, 2001
Let A and B be two disjoint sets of points in the plane such that no three points of A ∪ B are collinear, and let n be the number of points in A. A geometric complete bipartite graph K(A, B) is a complete bipartite graph with partite sets A and B which ...
M. Kano, Atsushi Kaneko
core   +1 more source

Clusterix: A Hybrid Visualization Model for Hierarchically Clustered Networks

Computer Graphics Forum, EarlyView.
Abstract We introduce Clusterix, a novel hybrid visualization model for representing hierarchically clustered networks, which also supports directed and weighted edges. Clusterix offers an integrated view of both the network and its full cluster hierarchy by compactly visualizing the cluster inclusion tree enriched with links of the network.
Carla Binucci, Annika Bonerath, Walter Didimo, Henry Förster, Seok‐Hee Hong, Maria Eleni Pavlidi, Alessandra Tappini   +6 more
wiley   +1 more source

Forest edges buffer effects of agricultural management on bee–plant interaction networks

Ecological Entomology, EarlyView.
Agricultural management effects: Organic and conventional crop margins host similar bee and plant species, but network structure differs: organic farms exhibit higher interaction diversity, conventional farms higher connectance. Role of forest edges: Native forest edges stabilize bee–plant networks by providing continuous floral resources and suitable ...
Samantha Marx de Castro, Cauê Nagatani, Vania Nobuko Yoshikawa, Franciny Yuko Urushima, Kelli dos Santos Ramos, Guaraci Duran Cordeiro, Maria Santina de Castro Morini   +6 more
wiley   +1 more source

Enumeration of Matchings in the Incidence Graphs of Complete and Complete Bipartite Graphs

SIAM Journal on Discrete Mathematics, 2002
Summary: If \(G=(V,E)\) is a graph, the incidence graph \(I(G)\) is the graph with vertices \(V\cup E\) and an edge joining \(v\in V\) and \(e\in E\) when and only when \(v\) is incident with \(e\) in \(G\). For \(G\) equal to \(K_{n}\) (the complete graph on \(n\) vertices) or \(K_{n,n}\) (the complete bipartite graph on \(n + n\) vertices), we ...
openaire   +3 more sources

Floral richness drives flower–insect networks in city gardens and allotments

Ecological Entomology, EarlyView.
Floral richness was the main driver of flower visits within green spaces whilst green space in the surrounding landscape influenced flower visits by amplifying the effects of floral richness. Native plants received more visits than non‐native plants, although flower visitor richness to non‐native plants increased later in the season as non‐native plant
Emma Plant, Ria Dunkley, William A. O. McGhee, Dominic J. McCafferty, Davide M. Dominoni   +4 more
wiley   +1 more source

Decomposition of Complete, Complete Bipartite, and Complete Tripartite Graphs into Half-Sunlet Graphs of Order Twelve

Mathematics
The half-sunlet graph HS3k is a 2k-cycle with a pendant edge at every alternate vertex (|V|=|E|=3k). We give a complete decomposition theory for HS12 (k=4), characterising when HS12 decomposes G for G complete, complete bipartite, and complete tripartite.
Gajendran Palaniyandi, Aramuthakannan Soundararajan, Sandhya Soundararajan   +2 more
doaj   +1 more source

Linking the Comparison and Graphical Approaches to Bipartite Matching

International Statistical Review, EarlyView.
Summary Bipartite record linkage has the goal of identifying observations referring to the same individual, called coreferent observations, across two distinct non‐duplicated datasets. The two main approaches to solve this task are the Fellegi–Sunter model, which relies on pairwise comparisons of observations, and the graphical record linkage model ...
Edoardo Redivo
wiley   +1 more source

Regular orientable embeddings of complete bipartite graphs

, 2018
In this paper, it will be shown that the isomorphism classes of regular orientable embeddings of the complete bipartite graph K-n,K-n are in one-to-one correspondence with the permutations on n elements satisfying a given criterion, and the isomorphism ...
Kwon, YS, Kwak, JH
core   +1 more source