EUDML | Stochastic queue core problem with an efficient length on a tree network

Skip to main content (access key 's'), Skip to navigation (access key 'n'), Accessibility information (access key '0')

Displaying similar documents to “Stochastic queue core problem with an efficient length on a tree network”

Heterogeneous queueing systems $M / M_{i} / 2$ with balking

Joanna Huk (1976)

Applicationes Mathematicae

Similarity:

Order relations in the set of probability distribution functions and their applications in queueing theory

Tomasz Rolski

Similarity:

CONTENTSIntroduction......................................................................................................................................... 51. n-Monotonic functions on (— ∞, ∞)........................................................................................... 62. Order relations in the set of probability distribution functions....................................................... 12 2.1. Preliminary concepts...............................................................................................................

Explicit formulas for transition intensities in the queueing system $E_{2} / E_{2} / n$

Maria Jankiewicz (1972)

Applicationes Mathematicae

Similarity:

On a characterization of $k$ -trees

De-Yan Zeng, Jian Hua Yin (2015)

Czechoslovak Mathematical Journal

Similarity:

A graph $G$ is a $k$ -tree if either $G$ is the complete graph on $k + 1$ vertices, or $G$ has a vertex $v$ whose neighborhood is a clique of order $k$ and the graph obtained by removing $v$ from $G$ is also a $k$ -tree. Clearly, a $k$ -tree has at least $k + 1$ vertices, and $G$ is a 1-tree (usual tree) if and only if it is a $1$ -connected graph and has no $K_{3}$ -minor. In this paper, motivated by some properties of 2-trees, we obtain a characterization of $k$ -trees as follows: if $G$ is a graph with at least $k + 1$ vertices, then $G$ is...

Spanning trees whose reducible stems have a few branch vertices

Pham Hoang Ha, Dang Dinh Hanh, Nguyen Thanh Loan, Ngoc Diep Pham (2021)

Czechoslovak Mathematical Journal

Similarity:

Let $T$ be a tree. Then a vertex of $T$ with degree one is a leaf of $T$ and a vertex of degree at least three is a branch vertex of $T$ . The set of leaves of $T$ is denoted by $L (T)$ and the set of branch vertices of $T$ is denoted by $B (T)$ . For two distinct vertices $u$ , $v$ of $T$ , let $P_{T} [u, v]$ denote the unique path in $T$ connecting $u$ and $v .$ Let $T$ be a tree with $B (T) \neq \emptyset$ . For each leaf $x$ of $T$ , let $y_{x}$ denote the nearest branch vertex to $x$ . We delete $V (P_{T} [x, y_{x}]) ∖ {y_{x}}$ from $T$ for all $x \in L (T)$ . The resulting subtree of $T$ is called the reducible stem...

The relation between the number of leaves of a tree and its diameter

Pu Qiao, Xingzhi Zhan (2022)

Czechoslovak Mathematical Journal

Similarity:

Let $L (n, d)$ denote the minimum possible number of leaves in a tree of order $n$ and diameter $d .$ Lesniak (1975) gave the lower bound $B (n, d) = ⌈ 2 (n - 1) / d ⌉$ for $L (n, d) .$ When $d$ is even, $B (n, d) = L (n, d) .$ But when $d$ is odd, $B (n, d)$ is smaller than $L (n, d)$ in general. For example, $B (21, 3) = 14$ while $L (21, 3) = 19 .$ In this note, we determine $L (n, d)$ using new ideas. We also consider the converse problem and determine the minimum possible diameter of a tree with given order and number of leaves.

A lower bound for the 3-pendant tree-connectivity of lexicographic product graphs

Yaping Mao, Christopher Melekian, Eddie Cheng (2023)

Czechoslovak Mathematical Journal

Similarity:

For a connected graph $G = (V, E)$ and a set $S \subseteq V (G)$ with at least two vertices, an $S$ -Steiner tree is a subgraph $T = (V^{'}, E^{'})$ of $G$ that is a tree with $S \subseteq V^{'}$ . If the degree of each vertex of $S$ in $T$ is equal to 1, then $T$ is called a pendant $S$ -Steiner tree. Two $S$ -Steiner trees are if they share no vertices other than $S$ and have no edges in common. For $S \subseteq V (G)$ and $| S | \geq 2$ , the pendant tree-connectivity $τ_{G} (S)$ is the maximum number of internally disjoint pendant $S$ -Steiner trees in $G$ , and for $k \geq 2$ , the $k$ -pendant tree-connectivity $τ_{k} (G)$ is the...

On the tree structure of the power digraphs modulo $n$

Amplify Sawkmie, Madan Mohan Singh (2015)

Czechoslovak Mathematical Journal

Similarity:

For any two positive integers $n$ and $k \geq 2$ , let $G (n, k)$ be a digraph whose set of vertices is ${0, 1, ..., n - 1}$ and such that there is a directed edge from a vertex $a$ to a vertex $b$ if $a^{k} \equiv b (mod n)$ . Let $n = \prod_{i = 1}^{r} p_{i}^{e_{i}}$ be the prime factorization of $n$ . Let $P$ be the set of all primes dividing $n$ and let $P_{1}, P_{2} \subseteq P$ be such that $P_{1} \cup P_{2} = P$ and $P_{1} \cap P_{2} = \emptyset$ . A fundamental constituent of $G (n, k)$ , denoted by $G_{P_{2}}^{*} (n, k)$ , is a subdigraph of $G (n, k)$ induced on the set of vertices which are multiples of $\prod_{p_{i} \in P_{2}} p_{i}$ and are relatively prime to all primes $q \in P_{1}$ . L. Somer and M. Křížek proved that the trees attached...

Quasi-tree graphs with the minimal Sombor indices

Yibo Li, Huiqing Liu, Ruiting Zhang (2022)

Czechoslovak Mathematical Journal

Similarity:

The Sombor index $S O (G)$ of a graph $G$ is the sum of the edge weights $\sqrt{d_{G}^{2} (u) + d_{G}^{2} (v)}$ of all edges $u v$ of $G$ , where $d_{G} (u)$ denotes the degree of the vertex $u$ in $G$ . A connected graph $G = (V, E)$ is called a quasi-tree if there exists $u \in V (G)$ such that $G - u$ is a tree. Denote $𝒬 (n, k) = {G : G$ is a quasi-tree graph of order $n$ with $G - u$ being a tree and $d_{G} (u) = k}$ . We determined the minimum and the second minimum Sombor indices of all quasi-trees in $𝒬 (n, k)$ . Furthermore, we characterized the corresponding extremal graphs, respectively.

On the $n$ -fold symmetric product of a space with a $σ$ - $(P)$ -property $c n$ -network ( $c k$ -network)

Luong Q. Tuyen, Ong V. Tuyen (2020)

Commentationes Mathematicae Universitatis Carolinae

Similarity:

We study the relation between a space $X$ satisfying certain generalized metric properties and its $n$ -fold symmetric product $ℱ_{n} (X)$ satisfying the same properties. We prove that $X$ has a $σ$ - $(P)$ -property $c n$ -network if and only if so does $ℱ_{n} (X)$ . Moreover, if $X$ is regular then $X$ has a $σ$ - $(P)$ -property $c k$ -network if and only if so does $ℱ_{n} (X)$ . By these results, we obtain that $X$ is strict $σ$ -space (strict $ℵ$ -space) if and only if so is $ℱ_{n} (X)$ .

Seeking a network characterization of Corson compacta

Ziqin Feng (2021)

Commentationes Mathematicae Universitatis Carolinae

Similarity:

We say that a collection $𝒜$ of subsets of $X$ has property $(C C)$ if there is a set $D$ and point-countable collections $𝒞$ of closed subsets of $X$ such that for any $A \in 𝒜$ there is a finite subcollection $ℱ$ of $𝒞$ such that $A = D ∖ ⋃ ℱ$ . Then we prove that any compact space is Corson if and only if it has a point- $σ$ - $(C C)$ base. A characterization of Corson compacta in terms of (strong) point network is also given. This provides an answer to an open question in “A Biased View of Topology as a Tool in Functional Analysis”...