Results 91 to 100 of about 5,946 (233)

Algorithm and Hardness Results for Outer-connected Dominating Set in Graphs

Journal of Graph Algorithms and Applications, 2014
A set D ⊆ V of a graph G = (V,E) is called an outer-connected dominating set of G if for all v ∈ V, |NG[v]∩D| ≥ 1, and the induced subgraph of G on V\D is connected.
B. Panda, Arti Pandey
doaj   +1 more source

Packing trees in complete bipartite graphs

Discussiones Mathematicae Graph Theory, 2019
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

Endogenous coalition formation in policy debates

American Journal of Political Science, EarlyView.
Abstract Political actors form coalitions around their joint normative beliefs in order to influence the policy process on contentious issues such as climate change or population aging. Policy process theory maintains that learning within and across coalitions is a central predictor of policy change but has yet to explain how policy learning works ...
Philip Leifeld, Laurence Brandenberger
wiley   +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, Hans Friedrich Köhn, Chia‐Yi Chiu   +2 more
wiley   +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, M. Levy, O. Avrahami, D. Samuel, D. Lischinski   +4 more
wiley   +1 more source

Complexity of Join and Corona graphs and Chebyshev polynomials

Journal of Taibah University for Science, 2018
Boesh and Prodinger have shown how to use properties of Chebyshev polynomials to compute formulas for the number of spanning trees of some special graphs.
S. N. Daoud
doaj   +1 more source

Connectivity of 2-distance graphs [PDF]

Journal of Mahani Mathematical Research
For a simple graph $G$, the $2$-distance graph, $D_2(G)$, is a graph with the vertex set $V(G)$ and two vertices are adjacent if their distance is $2$ in the graph $G$. In this paper, we characterize all graphs with connected $2$-distance graphs.
Sayyed Heidar Jafari, Seyed Reza Musawi
doaj   +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

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, J. Miller, A. Maftei, S. G. Kobourov   +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