On Spanning Wide Diameter of Graphs

A t-container Ct(u,v)is a set of t internally disjoint paths between two distinct vertices u and v in a graph G,i.e.,Ct(u,v)={P_(1),P_(2),···,Pt}.Moreover,if V(P_(1))∪V(P_(2))∪···∪V(Pt)=V(G)then Ct(u,v)is called a spanning t-container,denoted by C_(t)^(sc)(u,v).The length of C_(t)^(sc)(u,v)={P_(1),P_(2),···,Pt}is l(C_(t)^(sc)(u,v))=max{l(P_(i))|1≤i≤t}.A graph G is spanning t-connected if there exists a spanning t-container between any two distinct vertices u and v in G.Assume that u and v are two distinct vertices in a spanning t-connected graph G.Let D_(t)^(sc)(u,v)be the collection of all C_(t)^(sc)(u,v)’s.Define the spanning t-wide distance between u and v in G,d_(t)^(sc)(u,v)=min{l(C_(t)^(sc)(u,v))|C_(t)^(sc)(u,v)∈D_(t)^(sc)(u,v)},and the spanning t-wide diameter of G,D_(t)^(sc)(G)=max{d_(t)^(sc)(u,v)|u,v∈V(G)}.In particular,the spanning wide diameter of G is D_(κ)^(sc)(G),whereκis the connectivity of G.In the paper we provide the upper and lower bounds of the spanning wide diameter of a graph,and show that the bounds are best possible.We also determine the exact values of wide diameters of some well known graphs including Harary graphs and generalized Petersen graphs et al..

Reciprocal Distance Laplacian Eigenvalue Distribution Based on Graph Parameters

Let G be a connected graph of order n and m_(RD)^(L)_(G)I denote the number of reciprocal distance Laplacian eigenvaluesof G in an interval I.For a given interval I,we mainly present several bounds on m_(RD)^(L)_(G)I in terms of various structuralparameters of the graph G,including vertex-connectivity,independence number and pendant vertices.

Model Order Reduction Methods for Discrete Systems via Discrete Pulse Orthogonal Functions

This paper explores model order reduction(MOR)methods for discrete linear and discrete bilinear systems via discrete pulse orthogonal functions(DPOFs).Firstly,the discrete linear systems and the discrete bilinear systems are expanded in the space spanned by DPOFs,and two recurrence formulas for the expansion coefficients of the system’s state variables are obtained.Then,a modified Arnoldi process is applied to both recurrence formulas to construct the orthogonal projection matrices,by which the reduced-order systems are obtained.Theoretical analysis shows that the output variables of the reducedorder systems can match a certain number of the expansion coefficients of the original system’s output variables.Finally,two numerical examples illustrate the feasibility and effectiveness of the proposed methods.

On r-Hued Coloring of Hypercubes

For positive integers k and r,a(k,r)-coloring of graph G is a proper vertex k-coloring of G such that the neighbors of any vertex v∈V(G)receive at least min{d_(G)(v),r}different colors.The r-hued chromatic number of G,denoted χ_(r)(G),is the smallest integer k such that G admits a(k,r)-coloring.Let Q_(n) be the n-dimensional hypercube.For any integers n and r with n≥2 and 2≤r≤5,we investigated the behavior of χ_(r)(Q_(n)),and determined the exact value of χ_(2)(Q_(n))and χ_(3)(Q_(n))for all positive integers n.