An automatically connected graph representation based on B-splines for structural topology optimization
Sign Up to like & getrecommendations! Published in 2018 at "Structural and Multidisciplinary Optimization"
DOI: 10.1007/s00158-018-2170-5
Abstract: This paper introduces an automatically connected graph representation for structural topology optimization. Structural members of optimal topologies are constructed based on a graph whose each edge is represented by a B-spline curve with varying thickness.… read more here.
Keywords: structural topology; automatically connected; graph representation; topology ... See more keywords
On the Decomposition of a 3-Connected Graph into Cyclically 4-Edge-Connected Components
Sign Up to like & getrecommendations! Published in 2018 at "Journal of Mathematical Sciences"
DOI: 10.1007/s10958-018-3859-0
Abstract: A graph is called cyclically 4-edge-connected if removing any three edges from it results in a graph in which at most one connected component contains a cycle. A 3-connected graph is 4-edge-connected if and only… read more here.
Keywords: graph cyclically; connected components; decomposition connected; connected graph ... See more keywords
A Bound on the Number of Leaves in a Spanning Tree of a Connected Graph of Minimum Degree 6
Sign Up to like & getrecommendations! Published in 2018 at "Journal of Mathematical Sciences"
DOI: 10.1007/s10958-018-4132-2
Abstract: We prove that a connected graph of minimum degree 6 has a spanning tree such that at least 1121$$ \frac{11\ }{21} $$ of its vertices are leaves. read more here.
Keywords: bound number; graph minimum; connected graph; minimum degree ... See more keywords
Two Sufficient Conditions for 2-Connected Graphs to Have Proper Connection Number 2
Sign Up to like & getrecommendations! Published in 2019 at "Bulletin of the Malaysian Mathematical Sciences Society"
DOI: 10.1007/s40840-019-00868-9
Abstract: The proper connection number of a graph G , denoted by pc ( G ), is the minimum number of colors needed to color the edges of G so that every pair of distinct vertices… read more here.
Keywords: proper connection; number; connected graph; connection number ... See more keywords
Proper Disconnection of Graphs
Sign Up to like & getrecommendations! Published in 2019 at "Bulletin of the Malaysian Mathematical Sciences Society"
DOI: 10.1007/s40840-020-01069-5
Abstract: For an edge-colored graph G , a set F of edges of G is called a proper edge-cut if F is an edge-cut of G and any pair of adjacent edges in F are assigned… read more here.
Keywords: edge cut; connected graph; proper disconnection; disconnection ... See more keywords
A Noise History Decomposition Approach for Decentralized Optimal Control of Large-Scale Systems Defined Over a Weakly Connected Graph
Sign Up to like & getrecommendations! Published in 2022 at "IEEE Transactions on Systems, Man, and Cybernetics: Systems"
DOI: 10.1109/tsmc.2021.3064842
Abstract: This article investigates the decentralized optimal linear quadratic regulation (LQR) control for large-scale systems. The large-scale system is defined over a weakly connected graph. Assume that the information is transmitted along the edges in the… read more here.
Keywords: connected graph; large scale; scale systems; control ... See more keywords
Fixed-Time Leader-Following Consensus Tracking Control for Nonliear Multi-Agent Systems under Jointly Connected Graph
Sign Up to like & getrecommendations! Published in 2022 at "Entropy"
DOI: 10.3390/e24081130
Abstract: This paper researches the fixed-time leader-following consensus problem for nonlinear multi-agent systems (MASs) affected by unknown disturbances under the jointly connected graph. In order to achieve control goal, this paper designs a fixed-time consensus protocol,… read more here.
Keywords: connected graph; time; consensus; leader ... See more keywords