Results 141 to 150 of about 2,238,100 (388)
The Problem of Predecessors on Spanning Trees
Acta Polytechnica, 2011 We consider the equiprobable distribution of spanning trees on the square lattice. All bonds of each tree can be oriented uniquely with respect to an arbitrary chosen site called the root. The problem of predecessors is to find the probability that a path along the oriented bonds passes sequentially fixed sites i and j.
V. B. Priezzhev, V.S. Poghosyan
openaire +5 more sources
Design and Applications of Multi‐Frequency Programmable Metamaterials for Adaptive Stealth
Advanced Functional Materials, EarlyView.This article provides a comprehensive overview of metamaterials, including their fundamental principles, properties, synthesis techniques, and applications in stealth, as well as their challenges and future prospects. It covers topics that are more advanced than those typically discussed in existing review articles, while still being closely connected ...
Jonathan Tersur Orasugh +4 more
wiley +1 more source
Spanning Trees whose Stems have a Bounded Number of Branch Vertices
Discussiones Mathematicae Graph Theory, 2016 Let T be a tree, a vertex of degree one and a vertex of degree at least three is called a leaf and a branch vertex, respectively. The set of leaves of T is denoted by Leaf(T).
Yan Zheng
doaj +1 more source
A spanning tree model for Khovanov homology [PDF]
, 2004 We use a spanning tree model to prove a result of E. S. Lee on the support of Khovanov homology of alternating knots.Comment: 13 pages, 3 figures; Footnote 1 was changed, a remark was rephrased as a theorem, a reference was added, typos were ...
Wehrli, Stephan M.
core +2 more sources
Electrically Tunable On‐Chip Topological Photonics with Integrated Carbon Nanotubes
Advanced Functional Materials, EarlyView.This work demonstrates electrically tunable on‐chip topological THz devices by integrating 2D carbon nanotube (CNT) sheets with valley‐Hall photonic crystals, enabling broadband transmission modulation (71% modulation depth) and tunable narrowband filtering (0.54 GHz shift) through electrically induced thermal tuning. This advancement paves the way for
Jifan Yin +7 more
wiley +1 more source
Balancing Minimum Spanning and Shortest Path Trees
, 1995 This paper give a simple linear-time algorithm that, given a weighted digraph, finds a spanning tree that simultaneously approximates a shortest-path tree and a minimum spanning tree. The algorithm provides a continuous trade-off: given the two trees and
B. Raghavachari +15 more
core +3 more sources
Spanning trees and a conjecture of Kontsevich [PDF]
Annals of Combinatorics, 1998 18 pages. This version corrects some minor inaccuracies and adds some computational information provided by John ...
openaire +4 more sources
Advanced Functional Materials, EarlyView.Free‐standing plasmonic gold‐based fractal antennas are fabricated by 3D nanoprinting, employing focused electron beam induced deposition and an optimized purification method to remove carbon while conserving structural fidelity. Simulation and experiment show broadband plasmonic activity, including customizable polarizability, thereby paving the way ...
Verena Reisecker +6 more
wiley +1 more source
Extensions of the minimum labelling spanning tree problem
Journal of Telecommunications and Information Technology, 2006 In this paper we propose some extensions of the minimum labelling spanning tree problem. The main focus is on the minimum labelling Steiner tree problem: given a graph G with a color (label) assigned to each edge, and a subset Q of the nodes of G (basic
Raffaele Cerulli +2 more
doaj +1 more source
A note on the number of spanning trees of a graph [PDF]
, 1966 Iva Rohlíčková
openalex +1 more source