On adjacency-distance spectral radius and spread of graphs
4
Citation
20
Reference
10
Related Paper
Citation Trend
Keywords:
Adjacency list
Spectral Radius
This article presents a new construction algorithm for computer – aided plant layout. A case study is an assembly plant which will be expanded to construct a new plant. The layouts are generated by ALDEP and Adjacency – Based Heuristic that are evaluated by the maximize adjacency – based objective. The solution will be developed on the basis of mathematical expressions that can be evaluated objectively. For the results, found that the layout generated from Adjacency – Based Heuristic has the layout score better than the layout is generated by ALDEP, and Adjacency – Based Heuristic can generate the material handling distance less than the layout is generated by ALDEP.
Adjacency list
Page layout
Adjacency matrix
Cite
Citations (0)
Abstract A new data structure, called the Edge‐Oriented Adjacency List (EOAL), for representing undirected graphs is presented. It provides more information on the edges and requires less storage space than the conventional adjacency list. Furthermore, it is superior to the conventional adjacency list in both insertion and deletion operations.
Adjacency list
Undirected graph
Adjacency matrix
Cite
Citations (1)
We study the effect of three types of graft transformations to increase or decrease the distance spectral radius of uniform hypergraphs, and we determined the unique $k$-uniform hypertrees with maximum, second maximum, minimum and second minimum distance spectral radius, respectively.
Spectral Radius
Minimum distance
Cite
Citations (0)
Adjacency list
Adjacency matrix
Cite
Citations (31)
The relationship between the spectral radius and the stability radius is established via elementary calculation. The result gives a discrete counterpart of the existing result for continuous systems and provides an upper bound for the stability radius. The main result of the calculation is summarized in the form of a theorem.< >
Spectral Radius
Cite
Citations (15)
In this paper, we give upper and lower bounds for the spectral radius of a nonnegative irreducible matrix and characterize the equality cases. These bounds theoretically improve and generalize some known results of Duan et al.[X. Duan, B. Zhou, Sharp bounds on the spectral radius of a nonnegative matrix, Linear Algebra Appl. (2013), http://dx.doi.org/10.1016/j.laa.2013.08.026]. Finally, applying these bounds to various matrices associated with a graph, we obtain some new upper and lower bounds on various spectral radiuses of graphs, which generalize and improve some known results.
Spectral Radius
Spectral Properties
Linear algebra
Matrix (chemical analysis)
Cite
Citations (0)
Adjacency list
Floor plan
Breadth-first search
Tree (set theory)
Cite
Citations (30)
Adjacency list
Spectral Radius
Cite
Citations (4)
In this paper,we discuss the trees with bigger spectral radius.Furthermore we give the trees with 13th spectral radius to 32th spectral radius.Finally we give a new upper bound of the spectral radius of trees.
Spectral Radius
Cite
Citations (0)
Spectral Radius
Adjacency matrix
Matrix (chemical analysis)
Hypergraph
Cite
Citations (57)