4.3 Article

The generalized connectivity of alternating group graphs and (n, k)-star graphs

Journal

DISCRETE APPLIED MATHEMATICS
Volume 251, Issue -, Pages 310-321

Publisher

ELSEVIER SCIENCE BV
DOI: 10.1016/j.dam.2018.05.059

Keywords

Generalized connectivity; Fault-tolerance; Alternating group graph; (n, k)-star graph

Funding

  1. National Natural Science Foundation of China [11731002]
  2. Fundamental Research Funds for the Central Universities [2016JBM071, 2016JBZ012]
  3. 111 Project of China [B16002]

Ask authors/readers for more resources

Let S subset of V(G) and kappa(G)(S) denote the maximum number r of edge-disjoint trees T-1, T-2, ..., T-r in G such that V(T-i) boolean AND V(T-j) = S for any i, j is an element of{1, 2, ..., r} and i not equal j. For an integer k with 2 <= k <= n, the generalized k-connectivity of a graph G is defined as kappa(k)(G) = min{kappa(G)(S)vertical bar S subset of V(G) and vertical bar S vertical bar = k}. The generalized k-connectivity is a generalization of traditional connectivity. In this paper, we focus on the alternating group graphs and (n, k)-star graphs, denoted by AG(n) and S-n,S-k, respectively. We study the generalized 3-connectivity of the two kinds of graphs and show that kappa(3)(AG(n)) = 2n - 5 for n >= 4 and kappa(3)(S-n,S-k) = n - 2 for n >= k + 1 and k >= 4, which generalize the known result about star graphs given by Li et al. (2016). In addition, as the alternating group network AN(n) is isomorphic to S-n,S-k for k = n - 2, the generalized 3-connectivity of AN(n) for n >= 6 can be obtained directly. (C) 2018 Elsevier B.V. All rights reserved.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.3
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

Article Mathematics

Neighborhood union conditions for fractional [a, b]-covered graphs

Yuan Yuan, Rong-Xia Hao

BULLETIN OF THE MALAYSIAN MATHEMATICAL SCIENCES SOCIETY (2020)

Article Mathematics, Applied

Analysis on component connectivity of bubble-sort star graphs and burnt pancake graphs

Mei-Mei Gu, Rong-Xia Hao, Shyue-Ming Tang, Jou-Ming Chang

DISCRETE APPLIED MATHEMATICS (2020)

Editorial Material Mathematics, Applied

Comments on A Hamilton sufficient condition for completely independent spanning tree

Xiao-Wen Qin, Rong-Xia Hao, Kung-Jui Pai, Jou-Ming Chang

DISCRETE APPLIED MATHEMATICS (2020)

Article Computer Science, Theory & Methods

The Existence of Completely Independent Spanning Trees for Some Compound Graphs

Xiao-Wen Qin, Rong-Xia Hao, Jou-Ming Chang

IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS (2020)

Article Mathematics, Applied

The rank of a complex unit gain graph in terms of the matching number

Shengjie He, Rong-Xia Hao, Fengming Dong

LINEAR ALGEBRA AND ITS APPLICATIONS (2020)

Article Mathematics, Applied

The reliability analysis based on the generalized connectivity in balanced hypercubes

Chao Wei, Rong-Xia Hao, Jou-Ming Chang

Summary: The paper explores recent advances in network connectivity analysis with a focus on a more accurate method for evaluating connectivity among network nodes. By studying the generalized k-connectivity problem, it is proven that the n-dimensional balanced hypercube has specific connectivity characteristics.

DISCRETE APPLIED MATHEMATICS (2021)

Article Mathematics

Berge-Fulkerson coloring for C(12)-linked permutation graphs

Siyan Liu, Rong-Xia Hao, Cun-Quan Zhang, Zhang Zhang

Summary: This paper discusses the conjecture about perfect matchings in bridgeless cubic graphs and proves that some permutation graphs are colorable, further verifying this conjecture.

JOURNAL OF GRAPH THEORY (2021)

Article Computer Science, Theory & Methods

Packing internally disjoint Steiner trees to compute the κ3-connectivity in augmented cubes

Chao Wei, Rong-Xia Hao, Jou-Ming Chang

Summary: This paper focuses on constructing internally disjoint S-trees with |S| = 3 in the n-dimensional augmented cube A Q(n), and completely determines the kappa(3)-connectivity of A Q(n).

JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING (2021)

Article Mathematics, Applied

The vertex Turan density in 3-ary n-cubes?

Xiao-Chen Li, Rong-Xia Hao

Summary: In this paper, we investigate the vertex Turan density and bounds of forbidden configurations in the k-ary n-cube. We derive exact values and boundaries for different forbidden configurations and dimensions. The findings are significant for understanding and analyzing the structural properties of the n-cube.

DISCRETE APPLIED MATHEMATICS (2022)

Article Computer Science, Theory & Methods

Construction of Dual-CISTs on an Infinite Class of Networks

Xiao-Wen Qin, Rong-Xia Hao, Jie Wu

Summary: This article proves the existence of dual Completely Independent Spanning Trees (CISTs) in an infinite number of networks satisfying certain conditions. A unique algorithm for constructing a CIST partition is proposed, which can be easily implemented in various networks and parallel or distributed systems. Comparison analysis with known results shows the significant advantage of our proposed conditions, with a strict bound. These results provide a powerful framework for the design of fault-tolerant network topologies and routing protocols for future networks.

IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS (2022)

Article Mathematics, Applied

Bounds for the connected domination number of maximal outerplanar graphs

Shao-Liang Chen, Rong-Xia Hao, Xiao-Wen Qin

Summary: This paper introduces the concepts of connected dominating sets and their connected domination numbers in graphs, and proposes an algorithm for finding connected dominating sets in maximal outerplanar graphs. An upper bound for the connected domination number of maximal outerplanar graphs is obtained through this algorithm. Additionally, the advantages of the results are evaluated through simulations.

DISCRETE APPLIED MATHEMATICS (2022)

Article Mathematics, Applied

The 3-path-connectivity of the k-ary n-cube

Wen -Han Zhu, Rong-Xia Hao, Yan-Quan Feng, Jaeun Lee

Summary: In this paper, we investigate the Omega-paths and path connectivity in a connected simple graph G. By deeply exploring the structural properties of the k-ary n-cube Q(n)(k), we completely determine its 3-path connectivity.

APPLIED MATHEMATICS AND COMPUTATION (2023)

Article Mathematics, Applied

The 3-path-connectivity of the hypercubes

Wen-Han Zhu, Rong-Xia Hao, Lin Li

Summary: This paper studies the path connectivity and tree connectivity in graph theory, and provides definitions and properties. By utilizing existing results, upper bounds and tightness for certain graphs and hypercubes are obtained.

DISCRETE APPLIED MATHEMATICS (2022)

Article Computer Science, Theory & Methods

The High Faulty Tolerant Capability of the Alternating Group Graphs

Hui Zhang, Rong-Xia Hao, Xiao-Wen Qin, Cheng-Kuan Lin, Sun-Yuan Hsieh

Summary: This paper investigates the applications of matroidal connectivity and conditional matroidal connectivity in alternating group graphs and proves the connectivity under certain conditions. The experimental results show that the matroidal connectivity significantly improves the fault-tolerant capability of alternating group graphs.

IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS (2023)

Article Mathematics, Applied

Two-disjoint-cycle-cover bipancyclicity of bubble-sort star graphs

Hui Zhang, Rong-Xia Hao, Hong-Jian Lai, Jaeun Lee

Summary: This paper explores some properties of the n-dimensional bubble-sort star graph BSn and proves that when n ≥ 4, for any even integer l satisfying 4 < l < n!/2, there exist two vertex-disjoint cycles C1 and C2 in BSn such that |C1| = l and |C2| = n! - l. This result supplements the Hamiltonicity and the bipancyclicity of BSn.

DISCRETE APPLIED MATHEMATICS (2023)

Article Mathematics, Applied

Injective chromatic index of sparse graphs

Yuehua Bu, Peng Wang, Hongguo Zhu, Junlei Zhu

Summary: This paper investigates the injective-edge coloring of a sparse graph G, and proves that when mad(G) meets certain conditions, the injective chromatic index x(i)'(G) has a upper bound.

DISCRETE APPLIED MATHEMATICS (2024)

Article Mathematics, Applied

Degree and distance based topological descriptors of power graphs of finite non-abelian groups

Fawad Ali, Bilal A. Rather, Muhammad Naeem, Wei Wang

Summary: A topological descriptor is a numerical value derived from the molecular structure and is related to the important structural characteristics of the molecule. It is used to describe the composition of chemicals and their relationship with physical properties. This article explores various topological indices for power graphs of different finite groups.

DISCRETE APPLIED MATHEMATICS (2024)

Article Mathematics, Applied

The Geometric-Arithmetic index of trees with a given total domination number

Sergio Bermudo, Roslan Hasni, Fateme Movahedi, Juan E. Napoles

Summary: This article introduces a new graph index, the geometric-arithmetic index, and discusses the upper and lower bounds for this index in trees.

DISCRETE APPLIED MATHEMATICS (2024)

Article Mathematics, Applied

A note on rainbow-free colorings of uniform hypergraphs

Ran Gu, Hui Lei, Yongtang Shi, Yiqiao Wang

Summary: This paper discusses the existence of rainbow-free coloring in random k-uniform hypergraphs, and provides the threshold function and the answer.

DISCRETE APPLIED MATHEMATICS (2024)

Article Mathematics, Applied

The greatest values for atom-bond sum-connectivity index of graphs with given parameters

Fengwei Li, Qingfang Ye, Huajing Lu

Summary: This paper introduces the definition and application of the atom-bond sum-connectivity index (ABS index), and discusses its importance in studying molecular structures.

DISCRETE APPLIED MATHEMATICS (2024)

Article Mathematics, Applied

Minimal spread of integral circulant graphs

Milan Basic

Summary: This passage mainly describes the definition of integral circulant graph ICGn(D), the condition for adjacent vertices, and the characterization of minimal spread in the class of connected integral circulant graphs of a given order.

DISCRETE APPLIED MATHEMATICS (2024)

Article Mathematics, Applied

Some results on the Wiener index related to the Šoltés problem of graphs

Andrey A. Dobrynin, Konstantin V. Vorob'ev

Summary: This study investigates the relationship between the Wiener index and R-m(G) of a graph G, and establishes the existence and properties of graphs G that satisfy specific conditions.

DISCRETE APPLIED MATHEMATICS (2024)

Article Mathematics, Applied

Radio number for the Cartesian product of two trees

Devsi Bantva, Daphne Der-Fen Liu

Summary: This paper provides a lower bound for the radio number of the Cartesian product of two trees and presents three necessary and sufficient conditions as well as three sufficient conditions for achieving this bound. By applying these results, the radio number of the Cartesian product of two stars as well as a path and a star is determined.

DISCRETE APPLIED MATHEMATICS (2024)

Article Mathematics, Applied

Bounds on the defect of an octahedron in a rational lattice

Mikhail Fadin

Summary: This article discusses rational lattices, octahedral defects, and their relationship with monotonic increasing functions.

DISCRETE APPLIED MATHEMATICS (2024)

Article Mathematics, Applied

On strong edge-coloring of graphs with maximum degree 5

Jian Lu, Huiqing Liu, Xiaolan Hu

Summary: This paper investigates the problem of strong edge-coloring, and proves that when certain conditions are satisfied, the upper bound of the strong chromatic index is 29, thereby verifying Erdos' conjecture under certain circumstances.

DISCRETE APPLIED MATHEMATICS (2024)

Article Mathematics, Applied

Average-case complexity of a branch-and-bound algorithm for MIN DOMINATING SET

Tom Denat, Ararat Harutyunyan, Nikolaos Melissinos, Vangelis Th. Paschos

Summary: This paper studies the average-case complexity of a branch-and-bound algorithm for the MIN DOMINATING SET problem in random graphs. We identify phase transitions between subexponential and exponential average-case complexities, depending on the growth of the probability p with respect to the number n of nodes.

DISCRETE APPLIED MATHEMATICS (2024)

Article Mathematics, Applied

(n, m)-graphs with maximum exponential second Zagreb index

Lkhagva Buyantogtokh, Batmend Horoldagva

Summary: This paper discusses the application of the exponential second Zagreb index in graphs and proves a conjecture regarding the maximum index. It also identifies the properties of graphs with maximum index under certain conditions.

DISCRETE APPLIED MATHEMATICS (2024)

Article Mathematics, Applied

Coloring (P5, kite)-free graphs with small cliques

Shenwei Huang, Yiao Ju, T. Karthick

Summary: This paper studies the coloring of (P5, kite)-free graphs with small clique number. It provides color number bounds for different constraints on cliques and proves them for specific conditions. The paper also gives examples to demonstrate the tightness of the bounds and makes a conjecture for the more general case.

DISCRETE APPLIED MATHEMATICS (2024)

Article Mathematics, Applied

Some relations between the irreducible polynomials over a finite field and its quadratic extension

Ryul Kim

Summary: This paper establishes relations between irreducible polynomials over a finite field Fq and its quadratic extension Fq2. The paper considers the relation between the numbers of irreducible polynomials of a fixed degree over Fq and Fq2, as well as the relations between self-reciprocal irreducible polynomials over Fq and self-conjugatereciprocal irreducible polynomials over Fq2. The paper also provides formulas for the number and the product of all self-conjugate-reciprocal irreducible monic (SCRIM) polynomials over Fq2.

DISCRETE APPLIED MATHEMATICS (2024)

Article Mathematics, Applied

Combinatorial approach of unified Apostol-type polynomials using α-distanced words

Beata Benyi, Sithembele Nkonkobe

Summary: This paper introduces and lists weighted alpha-distanced words, showing their connection to the unified Apostol-type polynomials and providing combinatorial proofs of certain identities.

DISCRETE APPLIED MATHEMATICS (2024)