Steiner tree packing number and tree connectivity

Let $S$ be a set of at least two vertices in a graph $G$. A subtree $T$ of $G$ is a $S$-Steiner tree if $S?V\left(T\right)$. Two $S$-Steiner trees $T_1$ and $T_2$ are edge-disjoint (resp. internally vertex-disjoint) if $E\left(T_1\right)\cap E\left(T_2\right)=?$ (resp. $E\left(T_1\right)\cap E\left(T_2\right)=?$ and $V\left(T_1\right)\cap V\left(T_2\right)=S$). Let ${\lambda }_G\left(S\right)$ (resp. ${\kappa }_G\left(S\right)$) be the maximum number of edge-disjoint (resp. internally vertex-disjoint) $S$-Steiner trees in $G$, and let ${\lambda }_k\left(G\right)$ (resp. ${\kappa }_k\left(G\right)$) be the minimum ${\lambda }_G\left(S\right)$ (resp. ${\kappa }_G\left(S\right)$) for $S$ ranges over all $k$-subset of $V\left(G\right)$. Kriesell conjectured that if ${\lambda }_G\left(\{x,y\}\right)\ge 2k$ for any $x,y\in S$, then ${\lambda }_G\left(S\right)\ge k$. He proved that the conjecture holds for $\left|S\right|=3,4$. In this paper, we give a short proof of Kriesell’s Conjecture for $\left|S\right|=3,4$, and also show that ${\lambda }_k\left(G\right)\ge ?\frac{1}{k?1}?\frac{k?}{2}??$ (resp. ${\kappa }_k\left(G\right)\ge ?\frac{1}{k?1}?\frac{k?}{2}??$ ) if $\lambda \left(G\right)\ge ?$ (resp. $\kappa \left(G\right)\ge ?$) in $G$, where $k=3,4$. Moreover, we also study the relation between ${\kappa }_k\left(L\left(G\right)\right)$ and ${\lambda }_k\left(G\right)$, where $L\left(G\right)$ is the line graph of $G$.     

Modulation of synchronization dynamics in a network of self-sustained systems

This paper addresses the combined modulatory effects of non-nearest neighbor oscillators and local injection on synchronized states dynamics with their corresponding stability boundaries in a network of self-sustained systems. The Whittaker method and Floquet theory are used to predict analytically the stability of these states for identical and non-identical coupling parameters. Charts revealing the modulation of synchronized states and their stability boundaries at the second order of interaction in the cases of identical and non-identical coupling parameters are constructed with and without an external signal locally injected in the network. Numerical simulations validate and complement the results of analytical surveys. The limits of the stability regions are numerically explored when a small amount of Gaussian white noise is also injected in the network.     

Interval optimization based line sampling method for fuzzy and random reliability analysis

For structural system with fuzzy variables as well as random variables, a novel algorithm for obtaining membership function of fuzzy reliability is presented on interval optimization based Line Sampling (LS) method. In the presented algorithm, the value domain of the fuzzy variables under the given membership level is firstly obtained according to their membership functions. Then, in the value domain of the fuzzy variables, bounds of reliability of the structure are obtained by the nesting analysis of the interval optimization, which is performed by modern heuristic methods, and reliability analysis, which is achieved by the LS method in the reduced space of the random variables. In this way the uncertainties of the input variables are propagated to the safety measurement of the structure, and the membership function of the fuzzy reliability is obtained. The presented algorithm not only inherits the advantage of the direct Monte Carlo method in propagating and distinguishing the fuzzy and random uncertainties, but also can improve the computational efficiency tremendously in case of acceptable precision. Several examples are used to illustrate the advantages of the presented algorithm.     

Enhanced multi-Hoffmann heuristic for efficiently solving real-world assembly line balancing problems in automotive industry

In production systems of automobile manufacturers, multi-variant products are assembled on paced final assembly lines. The assignment of operations to workplaces and workers deter mines the productivity of the manufacturing process. In research, various exact and heuristic solution procedures have been developed for different versions of the so-called assembly line balancing problem.     

On minimal forbidden subgraph characterizations of balanced graphs

A graph is balanced if its clique-matrix contains no edge–vertex incidence matrix of an odd chordless cycle as a submatrix. While a forbidden induced subgraph characterization of balanced graphs is known, there is no such characterization by minimal forbidden induced subgraphs. In this work, we provide minimal forbidden induced subgraph characterizations of balanced graphs restricted to graphs that belong to one of the following graph classes: complements of bipartite graphs, line graphs of multigraphs, and complements of line graphs of multigraphs. These characterizations lead to linear-time recognition algorithms for balanced graphs within the same three graph classes.     

Even subgraphs of bridgeless graphs and 2-factors of line graphs

By Petersen's theorem, a bridgeless cubic multigraph has a 2-factor. Fleischner generalised this result to bridgeless multigraphs of minimum degree at least three by showing that every such multigraph has a spanning even subgraph. Our main result is that every bridgeless simple graph with minimum degree at least three has a spanning even subgraph in which every component has at least four vertices. We deduce that if G is a simple bridgeless graph with n vertices and minimum degree at least three, then its line graph has a 2-factor with at most max{1,(3n-4)/10} components. This upper bound is best possible.     

Line width analysis of a tunable optical filter based on free-space optics

The line width of a tunable optical filter based on free-space optics was analyzed. The relationship between the line width and the Gaussian beam waist was theoretically derived and experimentally verified. The experimental results meet the theoretical analysis well, which is beneficial for the design of a tunable optical filter based on free-space optics.