Results 111 to 120 of about 2,715,030 (252)
Wilson's map operations on regulat dessins and cyclotomic fields of definition
, 2009 Dessins d’enfants can be seen as bipartite graphs embedded in compact orientable surfaces. According to Grothendieck and others, a dessin uniquely determines a complex structure on the surface, even an algebraic structure as a projective algebraic curve ...
Streit, M. +3 more
core +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 +3 more
wiley +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 +6 more
wiley +1 more source
Parallel O(log(n)) time edge-colouring of trees and Halin graphs [PDF]
We present parallel O(log(n))-time algorithms for optimal edge colouring of trees and Halin graphs with n processors on a a parallel random access machine without write conflicts (P-RAM).
Gibbons, Alan (Alan M.) +2 more
core
Settling the nonorientable genus of the nearly complete bipartite graphs
, 2023 A graph is said to be nearly complete bipartite if it can be obtained by deleting a set of independent edges from a complete bipartite graph. The nonorientable genus of such graphs is known except in a few cases where the sizes of the partite classes ...
Singh, Warren, Sun, Timothy
core
Almost self-complementary factors of complete bipartite graphs [PDF]
, 1997 A complete bipartite graph without one edge, K̃n,m, is called almost complete bipartite graph. A graph K̃2n+1,2m+1 that can be decomposed into two isomorphic factors with a given diameter d is called d-isodecomposable.
Fronček, Dalibor
core +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 +6 more
wiley +1 more source
The study of the star arboricity of complete bipartite graphs
, 2010 碩士假設V1﹐V2為兩個集合﹐若V＝V1∪V2﹐V1∩V2＝Φ且E＝{uv︱u V1, v V2}﹐則稱(V, E)為完全二分圖。若︱V1︱＝m﹐︱V2︱＝n﹐則此完全二分圖記為Km,n。當︱V1︱＝1﹐︱V2︱＝n﹐稱K1,n為星圖﹙Star﹚。當圖G的每一個最大連通子圖都是星圖時﹐我們稱圖G為星林圖﹙Star-forest﹚。將圖G分割成邊相異之星林圖時﹐其最少星林圖的個數稱為G的星林分解數﹐用*(G)表示。 在本論文中﹐我們考慮的是完全二分圖K2n,2n+4﹐n≧3的星林分解數 ...
廖藝淳; Liao, Yi-chun
core +1 more source
On Incidence Coloring of Complete Multipartite and Semicubic Bipartite Graphs
Discussiones Mathematicae Graph Theory, 2018 In the paper, we show that the incidence chromatic number χi of a complete k-partite graph is at most Δ + 2 (i.e., proving the incidence coloring conjecture for these graphs) and it is equal to Δ + 1 if and only if the smallest part has only one vertex ...
Janczewski Robert +2 more
doaj +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