Results 111 to 120 of about 96,090 (258)
Discrete Mathematics, 2003 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
G. Sethuraman 0001, P. Selvaraju
openaire +2 more sources
On cyclic orthogonal double covers of circulant graphs by special infinite graphs
AKCE International Journal of Graphs and Combinatorics, 2017 In this article, a technique to construct cyclic orthogonal double covers (CODCs) of regular circulant graphs by certain infinite graph classes such as complete bipartite and tripartite graphs and disjoint union of butterfly and is introduced.
R. El-Shanawany, A. El-Mesady
doaj +1 more source
Identifiability conditions in cognitive diagnosis: Implications for Q‐matrix estimation algorithms
British Journal of Mathematical and Statistical Psychology, EarlyView.Abstract The Q‐matrix of a cognitively diagnostic assessment (CDA), documenting the item‐attribute associations, is a key component of any CDA. However, the true Q‐matrix underlying a CDA is never known and must be estimated—typically by content experts.
Hyunjoo Kim +2 more
wiley +1 more source
On Cartesian Products of Orthogonal Double Covers
International Journal of Mathematics and Mathematical Sciences, 2013 Let H be a graph on n vertices and 𝒢 a collection of n subgraphs of H, one for each vertex, where 𝒢 is an orthogonal double cover (ODC) of H if every edge of H occurs in exactly two members of 𝒢 and any two members share an edge whenever the ...
R. El Shanawany, M. Higazy, A. El Mesady
doaj +1 more source
Story2Board: A Training‐Free Approach for Expressive Visual Storytelling
Computer Graphics Forum, EarlyView.Abstract We present Story2Board, a training‐free framework for expressive storyboard generation from natural language. Existing methods narrowly focus on subject identity, overlooking key aspects of visual storytelling such as spatial composition, background evolution, and narrative pacing.
D. Dinkevich +4 more
wiley +1 more source
Quantitative Metrics for Edge Bundling of Network Visualizations
Computer Graphics Forum, EarlyView.Abstract Edge bundling is widely used for reducing visual clutter in large 2D network and trajectory visualizations. Various edge bundling methods have been proposed, each producing qualitatively distinct outputs for the same data; however, few quantitative metrics exist for systematic evaluation. In this paper, we propose a set of quantitative metrics
M. Wallinger +3 more
wiley +1 more source
Identity orientation of complete bipartite graphs
Discrete Mathematics, 2005 An identity orientation of a graph \(G\) is an orientation of some of the edges of \(E(G)\) such that the resulting partially oriented graph has no automorphism other than the identity. \textit{F. Harary} and \textit{M. S. Jacobson} [Discuss. Math., Graph Theory 21, 149--158 (2001; Zbl 1001.05062)] posed the following problem: For which values of \(s,t\
Frank Harary, Desh Ranjan
openaire +1 more source
Exploration of regularities in bipartite graphs using GEOGEBRA software
LatIAA classroom proposal is presented to integrate contents of Graph Theory and Linear Algebra in complete bipartite graphs, linking adjacency and Laplacian matrices, the eigenvalues of graphs will be determined, applicable to connectivity concepts. Students
E. Oliva, Mathias Díaz
semanticscholar +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
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 +2 more sources