A graph has exactly two main eigenvalues if and only if it is a 2-walk linear graph.In this paper,we show some necessary conditions that a 2-walk（a,b）-linear graph must obey.Using these conditions and some basic the...A graph has exactly two main eigenvalues if and only if it is a 2-walk linear graph.In this paper,we show some necessary conditions that a 2-walk（a,b）-linear graph must obey.Using these conditions and some basic theorems in graph theory,we characterize all 2-walk linear graphs with small cyclic graphs without pendants.The results are given in sort on unicyclic,bicyclic,tricyclic graphs.展开更多
A graph has exactly two main eigenvalues if and only if it is a 2-walk linear graph. In this paper, we show some structural properties that a 2-walk （a, b）-linear graph holds. According to these properties, we can e...A graph has exactly two main eigenvalues if and only if it is a 2-walk linear graph. In this paper, we show some structural properties that a 2-walk （a, b）-linear graph holds. According to these properties, we can estimate and characterize more 2-walk linear graphs that have exactly two main eigenvalues.展开更多
An engineering system may consist of several different types of components,belonging to such physical"domains"as mechanical,electrical,fluid,and thermal.It is termed a multi-domain(or multi-physics)system.Th...An engineering system may consist of several different types of components,belonging to such physical"domains"as mechanical,electrical,fluid,and thermal.It is termed a multi-domain(or multi-physics)system.The present paper concerns the use of linear graphs(LGs)to generate a minimal model for a multi-physics system.A state-space model has to be a minimal realization.Specifically,the number of state variables in the model should be the minimum number that can completely represent the dynamic state of the system.This choice is not straightforward.Initially,state variables are assigned to all the energy-storage elements of the system.However,some of the energy storage elements may not be independent,and then some of the chosen state variables will be redundant.An approach is presented in the paper,with illustrative examples in the mixed fluid-mechanical domains,to illustrate a way to recognize dependent energy storage elements and thereby obtain a minimal state-space model.System analysis in the frequency domain is known to be more convenient than in the time domain,mainly because the relevant operations are algebraic rather than differential.For achieving this objective,the state space model has to be converted into a transfer function.The direct way is to first convert the state-space model into the input-output differential equation,and then substitute the time derivative by the Laplace variable.This approach is shown in the paper.The same result can be obtained through the transfer function linear graph(TF LG)of the system.In a multi-physics system,first the physical domains have to be converted into an equivalent single domain(preferably,the output domain of the system),when using the method of TFLG.This procedure is illustrated as well,in the present paper.展开更多
The basis graph \%G\% for a linear programming consists of all bases under pivot transformations. A degenerate optimal basis graph G * is a subgraph of \%G\% induced by all optimal bases at a degenerate optimal verte...The basis graph \%G\% for a linear programming consists of all bases under pivot transformations. A degenerate optimal basis graph G * is a subgraph of \%G\% induced by all optimal bases at a degenerate optimal vertex x 0. In this paper, several conditions for the characterization of G * are presented.展开更多
A linear coloring of a graph G is a proper vertex coloring such that the graph induced by the vertices of any two color classes is the union of vertex-disjoint paths. The linear chromatic number lc（G） of G is the sm...A linear coloring of a graph G is a proper vertex coloring such that the graph induced by the vertices of any two color classes is the union of vertex-disjoint paths. The linear chromatic number lc（G） of G is the smallest number of colors in a linear coloring of G. In this paper, we prove that every planar graph G with maximum degree 5 is 11-linear-colorable.展开更多
In this paper, we adopt a novel topological approach to fault diagnosis. In our researches, global information will be introduced into electric power network, we are using mainly BFS of graph theory algorithms and lin...In this paper, we adopt a novel topological approach to fault diagnosis. In our researches, global information will be introduced into electric power network, we are using mainly BFS of graph theory algorithms and linear discriminant principle to resolve fast and exact analysis of faulty components and faulty sections, and finally accomplish fault diagnosis. The results of BFS and linear discriminant are identical. The main technical contributions and innovations in this paper include, introducing global information into electric power network, developing a novel topological analysis to fault diagnosis. Graph theory algorithms can be used to model many different physical and abstract systems such as transportation and communication networks, models for business administration, political science, and psychology and so on. And the linear discriminant is a procedure used to classify an object into one of several a priori groupings dependent on the individual characteristics of the object. In the study of fault diagnosis in electric power network, graph theory algorithms and linear discriminant technology must also have a good prospect of application.展开更多
We propose feasible experimental schemes for preparing all five-photon graph states. Our schemes require only linear optical elements, photon detectors and post-selection, which are available in current experiment so ...We propose feasible experimental schemes for preparing all five-photon graph states. Our schemes require only linear optical elements, photon detectors and post-selection, which are available in current experiment so that these schemes are within the reach of the current technology.展开更多
The idea of linear Diophantine fuzzy set(LDFS)theory with its control parameters is a strong model for machine learning and optimization under uncertainty.The activity times in the critical path method(CPM)representat...The idea of linear Diophantine fuzzy set(LDFS)theory with its control parameters is a strong model for machine learning and optimization under uncertainty.The activity times in the critical path method(CPM)representation procedures approach are initially static,but in the Project Evaluation and Review Technique(PERT)approach,they are probabilistic.This study proposes a novel way of project review and assessment methodology for a project network in a linear Diophantine fuzzy(LDF)environment.The LDF expected task time,LDF variance,LDF critical path,and LDF total expected time for determining the project network are all computed using LDF numbers as the time of each activity in the project network.The primary premise of the LDF-PERT approach is to address ambiguities in project network activity timesmore simply than other approaches such as conventional PERT,Fuzzy PERT,and so on.The LDF-PERT is an efficient approach to analyzing symmetries in fuzzy control systems to seek an optimal decision.We also present a new approach for locating LDF-CPM in a project network with uncertain and erroneous activity timings.When the available resources and activity times are imprecise and unpredictable,this strategy can help decision-makers make better judgments in a project.A comparison analysis of the proposed technique with the existing techniques has also been discussed.The suggested techniques are demonstrated with two suitable numerical examples.展开更多
For a fixed graph F,a graph G is F-saturated if it has no F as a subgraph,but does contain F after the addition of any new edge.The saturation number,sat(n,F),is the minimum number of edges of a graph in the set of al...For a fixed graph F,a graph G is F-saturated if it has no F as a subgraph,but does contain F after the addition of any new edge.The saturation number,sat(n,F),is the minimum number of edges of a graph in the set of all F-saturated graphs with order n.In this paper,we determine the saturation number sat(n,2P3∪tP2)and characterize the extremal graphs for n≥6t+8.展开更多
Graph realization from a matrix is an important topic in network topology. This paper presents an algorithm for the realization of a linear tree based on the study of the properties of the number of the single-link lo...Graph realization from a matrix is an important topic in network topology. This paper presents an algorithm for the realization of a linear tree based on the study of the properties of the number of the single-link loops that are incident to each tree branch in the fundamental loop matrix Bf. The proposed method judges the pendent properties of the tree branches, determines their order one by one and then achieves the realization of the linear tree. The graph that corresponds to Bf is eventually constructed by adding links to the obtained linear tree. The proposed method can be extended for the realization of a general tree.展开更多
A star forest is a forest whose components are stars. The star arboricity of a graph G,denoted by sa（ G）,is the minimum number of star forests needed to decompose G. Let k be a positive integer. A k-star forest is a...A star forest is a forest whose components are stars. The star arboricity of a graph G,denoted by sa（ G）,is the minimum number of star forests needed to decompose G. Let k be a positive integer. A k-star forest is a forest whose components are stars of order at most k ＋ 1. The k-star arboricity of a graph G,denoted by sak（ G）,is the minimum number of k-star forests needed to decompose G. In this paper,it is proved that if any two vertices of degree 3 are nonadjacent in a subcubic graph G then sa2（ G） ≤2.For general subcubic graphs G, a polynomial-time algorithm is described to decompose G into three 2-star forests. For a tree T and[Δ k, T）/k]t≤ sak（ T） ≤[Δ（ T）- 1/K]＋1,where Δ（ T） is the maximum degree of T.kMoreover,a linear-time algorithm is designed to determine whether sak（ T） ≤m for any tree T and any positive integers m and k.展开更多
针对雷达、微波辐射计及无线通信系统中大阵元最小冗余线性阵列(minimum redundancy linear array,MRLA)的获取难题——计算机长时间运算仅得有限解、易遗漏适配应用的最优阵列,通过分析L上元素最少的受限差基、最大连续基线长为L的MRL...针对雷达、微波辐射计及无线通信系统中大阵元最小冗余线性阵列(minimum redundancy linear array,MRLA)的获取难题——计算机长时间运算仅得有限解、易遗漏适配应用的最优阵列,通过分析L上元素最少的受限差基、最大连续基线长为L的MRLA、长度是L的完美稀疏尺的刻度值、L条边的极小优美图顶点标号各自定义的条件,经循环论证,证明四者数学等价;证明得到:线性阵列成对存在;线性阵列的冗余度≥1,阵元数超过4时冗余度>1;若MRLA最大连续基线长度为L且阵元数为n,则最大连续基线长度为L+1的MRLA阵元数不超过n+1.基于大规模MRLA数据分析,提出假设:冗余度≤1.5的线性阵列可视为MRLA.研究还发现了两类新型线性阵列解析公式,能高效筛选出无穷多的MRLA配置模式(即均为完美稀疏尺的刻度数值),并可根据实际需求灵活设定线性阵列冗余度的筛选阈值,为MRLA的应用和完美稀疏尺的设计提供了理论支撑.展开更多
We consider the real three-dimensional Euclidean Jordan algebra associated to a strongly regular graph. Then, the Krein parameters of a strongly regular graph are generalized and some generalized Krein admissibility c...We consider the real three-dimensional Euclidean Jordan algebra associated to a strongly regular graph. Then, the Krein parameters of a strongly regular graph are generalized and some generalized Krein admissibility conditions are deduced. Furthermore, we establish some relations between the classical Krein parameters and the generalized Krein parameters.展开更多
An algorithm for unsupervised linear discriminant analysis was presented. Optimal unsupervised discriminant vectors are obtained through maximizing covariance of all samples and minimizing covariance of local k-neares...An algorithm for unsupervised linear discriminant analysis was presented. Optimal unsupervised discriminant vectors are obtained through maximizing covariance of all samples and minimizing covariance of local k-nearest neighbor samples. The experimental results show our algorithm is effective.展开更多
Let G = (V,E) be a graph, where V(G) is a non-empty set of vertices and E(G) is a set of edges, e = uv∈E(G), d(u) is degree of vertex u. Then the first Zagreb polynomial and the first Zagreb index Zg<sub>1</...Let G = (V,E) be a graph, where V(G) is a non-empty set of vertices and E(G) is a set of edges, e = uv∈E(G), d(u) is degree of vertex u. Then the first Zagreb polynomial and the first Zagreb index Zg<sub>1</sub>(G,x) and Zg<sub>1</sub>(G) of the graph G are defined as Σ<sub>uv∈E(G)</sub>x<sup>(d<sub>u</sub>+d<sub>v</sub>)</sup> and Σ<sub>e=uv∈E(G)</sub>(d<sub>u</sub>+d<sub>v</sub>) respectively. Recently Ghorbani and Hosseinzadeh introduced the first Eccentric Zagreb index as Zg<sub>1</sub>*</sup>=Σ<sub>uv∈E(G)</sub>(ecc(v)+ecc(u)), that ecc(u) is the largest distance between u and any other vertex v of G. In this paper, we compute this new index (the first Eccentric Zagreb index or third Zagreb index) of an infinite family of linear Polycene parallelogram of benzenoid.展开更多
基金Supported by the National Natural Science Foundation of China (10671081)
文摘A graph has exactly two main eigenvalues if and only if it is a 2-walk linear graph.In this paper,we show some necessary conditions that a 2-walk（a,b）-linear graph must obey.Using these conditions and some basic theorems in graph theory,we characterize all 2-walk linear graphs with small cyclic graphs without pendants.The results are given in sort on unicyclic,bicyclic,tricyclic graphs.
基金Supported by the National Natural Science Foundation of China(11171129)
文摘A graph has exactly two main eigenvalues if and only if it is a 2-walk linear graph. In this paper, we show some structural properties that a 2-walk （a, b）-linear graph holds. According to these properties, we can estimate and characterize more 2-walk linear graphs that have exactly two main eigenvalues.
基金supported by research grants from the Natural Sciences and Engineering Research Council(NSERC)of Canada
文摘An engineering system may consist of several different types of components,belonging to such physical"domains"as mechanical,electrical,fluid,and thermal.It is termed a multi-domain(or multi-physics)system.The present paper concerns the use of linear graphs(LGs)to generate a minimal model for a multi-physics system.A state-space model has to be a minimal realization.Specifically,the number of state variables in the model should be the minimum number that can completely represent the dynamic state of the system.This choice is not straightforward.Initially,state variables are assigned to all the energy-storage elements of the system.However,some of the energy storage elements may not be independent,and then some of the chosen state variables will be redundant.An approach is presented in the paper,with illustrative examples in the mixed fluid-mechanical domains,to illustrate a way to recognize dependent energy storage elements and thereby obtain a minimal state-space model.System analysis in the frequency domain is known to be more convenient than in the time domain,mainly because the relevant operations are algebraic rather than differential.For achieving this objective,the state space model has to be converted into a transfer function.The direct way is to first convert the state-space model into the input-output differential equation,and then substitute the time derivative by the Laplace variable.This approach is shown in the paper.The same result can be obtained through the transfer function linear graph(TF LG)of the system.In a multi-physics system,first the physical domains have to be converted into an equivalent single domain(preferably,the output domain of the system),when using the method of TFLG.This procedure is illustrated as well,in the present paper.
基金Project supported by the National Natural Science Foundation of China!(19771075)
文摘The basis graph \%G\% for a linear programming consists of all bases under pivot transformations. A degenerate optimal basis graph G * is a subgraph of \%G\% induced by all optimal bases at a degenerate optimal vertex x 0. In this paper, several conditions for the characterization of G * are presented.
基金Supported by the National Natural Science Foundation of China (Grant No. 11071223)the Natural ScienceFoundation of Zhejiang Province (Grant No. Z6090150)Research Project of Zhejiang Educational Committee(Grant No. Y201121311)
文摘A linear coloring of a graph G is a proper vertex coloring such that the graph induced by the vertices of any two color classes is the union of vertex-disjoint paths. The linear chromatic number lc（G） of G is the smallest number of colors in a linear coloring of G. In this paper, we prove that every planar graph G with maximum degree 5 is 11-linear-colorable.
文摘In this paper, we adopt a novel topological approach to fault diagnosis. In our researches, global information will be introduced into electric power network, we are using mainly BFS of graph theory algorithms and linear discriminant principle to resolve fast and exact analysis of faulty components and faulty sections, and finally accomplish fault diagnosis. The results of BFS and linear discriminant are identical. The main technical contributions and innovations in this paper include, introducing global information into electric power network, developing a novel topological analysis to fault diagnosis. Graph theory algorithms can be used to model many different physical and abstract systems such as transportation and communication networks, models for business administration, political science, and psychology and so on. And the linear discriminant is a procedure used to classify an object into one of several a priori groupings dependent on the individual characteristics of the object. In the study of fault diagnosis in electric power network, graph theory algorithms and linear discriminant technology must also have a good prospect of application.
文摘We propose feasible experimental schemes for preparing all five-photon graph states. Our schemes require only linear optical elements, photon detectors and post-selection, which are available in current experiment so that these schemes are within the reach of the current technology.
基金supported by the Deanship of Scientific Research,Vice Presidency for Graduate Studies and Scientific Research,King Faisal University,Saudi Arabia[Grant No.GRANT3862].
文摘The idea of linear Diophantine fuzzy set(LDFS)theory with its control parameters is a strong model for machine learning and optimization under uncertainty.The activity times in the critical path method(CPM)representation procedures approach are initially static,but in the Project Evaluation and Review Technique(PERT)approach,they are probabilistic.This study proposes a novel way of project review and assessment methodology for a project network in a linear Diophantine fuzzy(LDF)environment.The LDF expected task time,LDF variance,LDF critical path,and LDF total expected time for determining the project network are all computed using LDF numbers as the time of each activity in the project network.The primary premise of the LDF-PERT approach is to address ambiguities in project network activity timesmore simply than other approaches such as conventional PERT,Fuzzy PERT,and so on.The LDF-PERT is an efficient approach to analyzing symmetries in fuzzy control systems to seek an optimal decision.We also present a new approach for locating LDF-CPM in a project network with uncertain and erroneous activity timings.When the available resources and activity times are imprecise and unpredictable,this strategy can help decision-makers make better judgments in a project.A comparison analysis of the proposed technique with the existing techniques has also been discussed.The suggested techniques are demonstrated with two suitable numerical examples.
基金Supported by the National Natural Science Foundation of China(11071096,11171129)the Natural Science Foundation of Hubei Province(2016CFB146)Research Foundation of College of Economics,Northwest University of Political Science and Law(19XYKY07)
文摘For a fixed graph F,a graph G is F-saturated if it has no F as a subgraph,but does contain F after the addition of any new edge.The saturation number,sat(n,F),is the minimum number of edges of a graph in the set of all F-saturated graphs with order n.In this paper,we determine the saturation number sat(n,2P3∪tP2)and characterize the extremal graphs for n≥6t+8.
文摘Graph realization from a matrix is an important topic in network topology. This paper presents an algorithm for the realization of a linear tree based on the study of the properties of the number of the single-link loops that are incident to each tree branch in the fundamental loop matrix Bf. The proposed method judges the pendent properties of the tree branches, determines their order one by one and then achieves the realization of the linear tree. The graph that corresponds to Bf is eventually constructed by adding links to the obtained linear tree. The proposed method can be extended for the realization of a general tree.
基金National Natural Science Foundation of China(No.10971025)
文摘A star forest is a forest whose components are stars. The star arboricity of a graph G,denoted by sa（ G）,is the minimum number of star forests needed to decompose G. Let k be a positive integer. A k-star forest is a forest whose components are stars of order at most k ＋ 1. The k-star arboricity of a graph G,denoted by sak（ G）,is the minimum number of k-star forests needed to decompose G. In this paper,it is proved that if any two vertices of degree 3 are nonadjacent in a subcubic graph G then sa2（ G） ≤2.For general subcubic graphs G, a polynomial-time algorithm is described to decompose G into three 2-star forests. For a tree T and[Δ k, T）/k]t≤ sak（ T） ≤[Δ（ T）- 1/K]＋1,where Δ（ T） is the maximum degree of T.kMoreover,a linear-time algorithm is designed to determine whether sak（ T） ≤m for any tree T and any positive integers m and k.
文摘针对雷达、微波辐射计及无线通信系统中大阵元最小冗余线性阵列(minimum redundancy linear array,MRLA)的获取难题——计算机长时间运算仅得有限解、易遗漏适配应用的最优阵列,通过分析L上元素最少的受限差基、最大连续基线长为L的MRLA、长度是L的完美稀疏尺的刻度值、L条边的极小优美图顶点标号各自定义的条件,经循环论证,证明四者数学等价;证明得到:线性阵列成对存在;线性阵列的冗余度≥1,阵元数超过4时冗余度>1;若MRLA最大连续基线长度为L且阵元数为n,则最大连续基线长度为L+1的MRLA阵元数不超过n+1.基于大规模MRLA数据分析,提出假设:冗余度≤1.5的线性阵列可视为MRLA.研究还发现了两类新型线性阵列解析公式,能高效筛选出无穷多的MRLA配置模式(即均为完美稀疏尺的刻度数值),并可根据实际需求灵活设定线性阵列冗余度的筛选阈值,为MRLA的应用和完美稀疏尺的设计提供了理论支撑.
基金supported by the European Regional Development Fund through the program COMPETEby the Portuguese Government through the FCT—Fundacao para a Ciencia e a Tecnologia under the project PEst—C/MAT/UI0144/2013+1 种基金partially supported by Portuguese Funds trough CIDMA—Center for Research and development in Mathematics and Applications,Department of Mathematics,University of Aveiro,3810-193,Aveiro,Portugalthe Portuguese Foundation for Science and Technology(FCT-Fundacao para a Ciencia e Tecnologia),within Project PEst-OE/MAT/UI4106/2014
文摘We consider the real three-dimensional Euclidean Jordan algebra associated to a strongly regular graph. Then, the Krein parameters of a strongly regular graph are generalized and some generalized Krein admissibility conditions are deduced. Furthermore, we establish some relations between the classical Krein parameters and the generalized Krein parameters.
文摘An algorithm for unsupervised linear discriminant analysis was presented. Optimal unsupervised discriminant vectors are obtained through maximizing covariance of all samples and minimizing covariance of local k-nearest neighbor samples. The experimental results show our algorithm is effective.
文摘Let G = (V,E) be a graph, where V(G) is a non-empty set of vertices and E(G) is a set of edges, e = uv∈E(G), d(u) is degree of vertex u. Then the first Zagreb polynomial and the first Zagreb index Zg<sub>1</sub>(G,x) and Zg<sub>1</sub>(G) of the graph G are defined as Σ<sub>uv∈E(G)</sub>x<sup>(d<sub>u</sub>+d<sub>v</sub>)</sup> and Σ<sub>e=uv∈E(G)</sub>(d<sub>u</sub>+d<sub>v</sub>) respectively. Recently Ghorbani and Hosseinzadeh introduced the first Eccentric Zagreb index as Zg<sub>1</sub>*</sup>=Σ<sub>uv∈E(G)</sub>(ecc(v)+ecc(u)), that ecc(u) is the largest distance between u and any other vertex v of G. In this paper, we compute this new index (the first Eccentric Zagreb index or third Zagreb index) of an infinite family of linear Polycene parallelogram of benzenoid.
