Origami Crawlers: Exploring A Single Origami Vertex for Complex Path Navigation
Sign Up to like & getrecommendations! Published in 2024 at "Advanced Materials"
DOI: 10.1002/adma.202502293
Abstract: The ancient art of origami, traditionally used to transform simple sheets into intricate objects, also holds potential for diverse engineering applications, such as shape morphing and robotics. In this study, it is demonstrated that one… read more here.
Keywords: vertex; navigation; origami crawlers; single origami ... See more keywords
Discontinuous deformation analysis handling vertex‐vertex contact based on principle of least effort
Sign Up to like & getrecommendations! Published in 2020 at "International Journal for Numerical Methods in Engineering"
DOI: 10.1002/nme.6427
Abstract: This study establishes an innovative discontinuous deformation analysis by solving the problem of frictional and cohesive contact using an implicit cone complementary formulation. In order to handle singularity associated with the vertex‐vertex contact, resistances to… read more here.
Keywords: vertex; vertex vertex; vertex contact; contact ... See more keywords
Theta expansion of first massive vertex operator in pure spinor
Sign Up to like & getrecommendations! Published in 2017 at "Journal of High Energy Physics"
DOI: 10.1007/jhep01(2018)019
Abstract: A bstractWe provide the covariant superspace equations that are sufficient to determine the complete θ expansion of the vertex operator of the open string massive states with (mass)2 = 1/α′ in pure spinor formalism of… read more here.
Keywords: vertex; vertex operator; theta expansion; pure spinor ... See more keywords
Topological vertex for 6d SCFTs with ℤ2-twist
Sign Up to like & getrecommendations! Published in 2021 at "Journal of High Energy Physics"
DOI: 10.1007/jhep03(2021)132
Abstract: We compute the partition function for 6d $$ \mathcal{N} $$ = 1 SO(2N) gauge theories compactified on a circle with ℤ2 outer automorphism twist. We perform the computation based on 5-brane webs with two O5-planes… read more here.
Keywords: topological vertex; vertex; vertex scfts; scfts twist ... See more keywords
O-vertex, O7+-plane, and topological vertex
Sign Up to like & getrecommendations! Published in 2024 at "Journal of High Energy Physics"
DOI: 10.1007/jhep04(2025)182
Abstract: We revisit the instanton partition function for 5d N\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$ \mathcal{N} $$\end{document} = 1 SO(N) gauge theories compactified on S1, computed from the topological vertex formalism with… read more here.
Keywords: vertex; plane topological; topological vertex; vertex plane ... See more keywords
Half-BPS vertex operators of the AdS5 × S5 superstring
Sign Up to like & getrecommendations! Published in 2019 at "Journal of High Energy Physics"
DOI: 10.1007/jhep07(2019)084
Abstract: A bstractUsing the pure spinor formalism for the superstring in an AdS5 × S5 background, a simple expression is found for half-BPS vertex operators. At large radius, these vertex operators reduce to the usual supergravity… read more here.
Keywords: vertex operators; operators ads5; bps vertex; half bps ... See more keywords
The adjacent vertex distinguishing total chromatic numbers of planar graphs with $$\Delta =10$$Δ=10
Sign Up to like & getrecommendations! Published in 2017 at "Journal of Combinatorial Optimization"
DOI: 10.1007/s10878-016-9995-x
Abstract: A (proper) total-k-coloring of a graph G is a mapping $$\phi : V (G) \cup E(G)\mapsto \{1, 2, \ldots , k\}$$ϕ:V(G)∪E(G)↦{1,2,…,k} such that any two adjacent elements in $$V (G) \cup E(G)$$V(G)∪E(G) receive different colors.… read more here.
Keywords: vertex distinguishing; distinguishing total; adjacent vertex; delta ... See more keywords
A simpler PTAS for connected k-path vertex cover in homogeneous wireless sensor network
Sign Up to like & getrecommendations! Published in 2018 at "Journal of Combinatorial Optimization"
DOI: 10.1007/s10878-018-0283-9
Abstract: Because of its application in the field of security in wireless sensor networks, k-path vertex cover ($$\hbox {VCP}_k$$VCPk) has received a lot of attention in recent years. Given a graph $$G=(V,E)$$G=(V,E), a vertex set $$C\subseteq… read more here.
Keywords: vertex; path vertex; vertex cover; wireless sensor ... See more keywords
Pentavalent vertex-transitive diameter two graphs
Sign Up to like & getrecommendations! Published in 2017 at "Frontiers of Mathematics in China"
DOI: 10.1007/s11464-016-0617-9
Abstract: We classify the family of pentavalent vertex-transitive graphs Γ with diameter 2. Suppose that the automorphism group of Γ is transitive on the set of ordered distance 2 vertex pairs. Then we show that either… read more here.
Keywords: graphs; vertex transitive; kern 1pt; vertex ... See more keywords
Double vertex-edge domination in graphs: complexity and algorithms
Sign Up to like & getrecommendations! Published in 2020 at "Journal of Applied Mathematics and Computing"
DOI: 10.1007/s12190-020-01433-5
Abstract: In a graph $$G=(V,E)$$ , a vertex $$v\in V$$ is said to ve-dominate the edges incident on v as well as the edges adjacent to these incident edges on v. A set $$D\subseteq V$$ is… read more here.
Keywords: graphs; double vertex; edge; min dveds ... See more keywords
Influence of the Edge Removal, Edge Addition and Edge Subdivision on the Double Vertex–Edge Domination Number of a Graph
Sign Up to like & getrecommendations! Published in 2018 at "National Academy Science Letters"
DOI: 10.1007/s40009-018-0689-z
Abstract: A vertex v of a graph $$G=(V,E)$$G=(V,E) is said to ve-dominate every edge incident to v, as well as every edge adjacent to these incident edges. A set $$S \subseteq V$$S⊆V is a vertex–edge dominating… read more here.
Keywords: edge domination; domination number; double vertex; edge ... See more keywords