circular ladder
Recently Published Documents


TOTAL DOCUMENTS

10
(FIVE YEARS 4)

H-INDEX

0
(FIVE YEARS 0)

2021 ◽  
Author(s):  
◽  
Susan Jowett

<p>We show that for every n ≥ 3 there is some number m such that every 4-connected binary matroid with an M (K3,m)-minor or an M* (K3,m)-minor and no rank-n minor isomorphic to M* (K3,n) blocked in a path-like way, has a minor isomorphic to one of the following: M (K4,n), M* (K4,n), the cycle matroid of an n-spoke double wheel, the cycle matroid of a rank-n circular ladder, the cycle matroid of a rank-n Möbius ladder, a matroid obtained by adding an element in the span of the petals of M (K3,n) but not in the span of any subset of these petals and contracting this element, or a rank-n matroid closely related to the cycle matroid of a double wheel, which we call a non graphic double wheel. We also show that for all n there exists m such that the following holds. If M is a 4-connected binary matroid with a sufficiently large spanning restriction that has a certain structure of order m that generalises a swirl-like flower, then M has one of the following as a minor: a rank-n spike, M (K4,n), M* (K4,n), the cycle matroid of an n-spoke double wheel, the cycle matroid of a rank-n circular ladder, the cycle matroid of a rank-n Möbius ladder, a matroid obtained by adding an element in the span of the petals of M (K3,n) but not in the span of any subset of these petals and contracting this element, a rank-n non graphic double wheel, M* (K3,n) blocked in a path-like way or a highly structured 3-connected matroid of rank n that we call a clam.</p>



2021 ◽  
Author(s):  
◽  
Susan Jowett

<p>We show that for every n ≥ 3 there is some number m such that every 4-connected binary matroid with an M (K3,m)-minor or an M* (K3,m)-minor and no rank-n minor isomorphic to M* (K3,n) blocked in a path-like way, has a minor isomorphic to one of the following: M (K4,n), M* (K4,n), the cycle matroid of an n-spoke double wheel, the cycle matroid of a rank-n circular ladder, the cycle matroid of a rank-n Möbius ladder, a matroid obtained by adding an element in the span of the petals of M (K3,n) but not in the span of any subset of these petals and contracting this element, or a rank-n matroid closely related to the cycle matroid of a double wheel, which we call a non graphic double wheel. We also show that for all n there exists m such that the following holds. If M is a 4-connected binary matroid with a sufficiently large spanning restriction that has a certain structure of order m that generalises a swirl-like flower, then M has one of the following as a minor: a rank-n spike, M (K4,n), M* (K4,n), the cycle matroid of an n-spoke double wheel, the cycle matroid of a rank-n circular ladder, the cycle matroid of a rank-n Möbius ladder, a matroid obtained by adding an element in the span of the petals of M (K3,n) but not in the span of any subset of these petals and contracting this element, a rank-n non graphic double wheel, M* (K3,n) blocked in a path-like way or a highly structured 3-connected matroid of rank n that we call a clam.</p>



2021 ◽  
Vol 29 (1) ◽  
Author(s):  
M. Basher

AbstractA simple graph $$G=(V,E)$$ G = ( V , E ) is said to be k-Zumkeller graph if there is an injective function f from the vertices of G to the natural numbers N such that when each edge $$xy\in E$$ x y ∈ E is assigned the label f(x)f(y), the resulting edge labels are k distinct Zumkeller numbers. In this paper, we show that the super subdivision of path, cycle, comb, ladder, crown, circular ladder, planar grid and prism are k-Zumkeller graphs.



Author(s):  
Sunny Kumar Sharma ◽  
Vijay Kumar Bhat

Let [Formula: see text] be an undirected (i.e., all the edges are bidirectional), simple (i.e., no loops and multiple edges are allowed), and connected (i.e., between every pair of nodes, there exists a path) graph. Let [Formula: see text] denotes the number of edges in the shortest path or geodesic distance between two vertices [Formula: see text]. The metric dimension (or the location number) of some families of plane graphs have been obtained in [M. Imran, S. A. Bokhary and A. Q. Baig, Families of rotationally-symmetric plane graphs with constant metric dimension, Southeast Asian Bull. Math. 36 (2012) 663–675] and an open problem regarding these graphs was raised that: Characterize those families of plane graphs [Formula: see text] which are obtained from the graph [Formula: see text] by adding new edges in [Formula: see text] such that [Formula: see text] and [Formula: see text]. In this paper, by answering this problem, we characterize some families of plane graphs [Formula: see text], which possesses the radial symmetry and has a constant metric dimension. We also prove that some families of plane graphs which are obtained from the plane graphs, [Formula: see text] by the addition of new edges in [Formula: see text] have the same metric dimension and vertices set as [Formula: see text], and only 3 nodes appropriately selected are sufficient to resolve all the nodes of these families of plane graphs.



In a graph G = (V, E) each vertex is said to dominate every vertex in its closed neighborhood. In a graph G, if S is a subset of V then S is a double dominating set of G if every vertex in V is dominated by at least two vertices in S. The smallest cardinality of a double dominating set is called the double domination number γx2 (G). [4]. In this paper, we computed some relations between double domination number, domination number, number of vertices (n) and maximum degree (∆) of Helm graph, Friendship graph, Ladder graph, Circular Ladder graph, Barbell graph, Gear graph and Firecracker graph.



2020 ◽  
Vol 1465 ◽  
pp. 012021
Author(s):  
D M O Suni ◽  
Dafik ◽  
I M Tirta ◽  
A I Kristiana ◽  
R Nisviasari


Author(s):  
Dong Liu ◽  
Minghao Wang ◽  
Ming Cong

Purpose The purpose of this paper is to solve the common problems of outer phenomenon and stress concentration among pneumatic networks soft actuators. Design/methodology/approach On the basis of imitating the caterpillar structure, the new soft actuator adopts the integral circular ladder structure instead of the traditional independent distributed structure as the air chamber. Through the comparison of several different structures, the parabolic in-wall curve is found to be fit for designing the optimal integrated chamber structure of the soft actuator. The curve function of each ladder chamber is computed based on the torque distribution model, aiming to decrease the terminal deformation. Meanwhile, the FEM analysis method is applied to establish the motion model of the integrated parabolic ladder soft actuator. The model’s accuracy, as well as structure’s deformation and stress, are verified. Findings Compared with the FEM data, the experimental data indicate that the new soft actuator has no obvious outer phenomenon, the maximum stress decreases and the stiffness increases. The new actuator is applied for designing a flexible gripper to grasp objects of different shapes and sizes. The gripper can grasp objects of 52.6 times its own mass. Practical implications The designed gripper is available for flexible production in various fields, such as capturing fruits of different sizes, soft foods or parts with complex shapes. Originality/value This paper proposes a new type soft actuator, which provides a solution for exploring the field of the soft robot. The problems of outer phenomenon and stress concentration are suppressed with pneumatic networks soft actuators.



2017 ◽  
Vol 13 (1) ◽  
pp. 73-87
Author(s):  
C. Jayasekaran ◽  
◽  
J. Little Flower


Sign in / Sign up

Export Citation Format

Share Document