Results 191 to 200 of about 42,885 (208)
Some of the next articles are maybe not open access.
The effect on A α -eigenvalues of mixed graphs and unit gain graphs by adding edges in clusters
Linear and multilinear algebra, 2021Given a simple graph G, a -cluster of G is a pair of vertex subsets , where size of C is and every vertex in C shares the same set S of s neighbours. Let be a mixed graph whose underlying graph G contains a -cluster and let be a mixed graph on c vertices.
Shuchao Li, Yuantian Yu
semanticscholar +1 more source
Spectra of complex unit hypergraphs
The Art of Discrete and Applied Mathematics, 2020A complex unit hypergraph is a hypergraph where each vertex-edge incidence is given a complex unit label. We define the adjacency, incidence, Kirchoff Laplacian and normalized Laplacian of a complex unit hypergraph and study each of them.
R. Mulas, Nathan Reff
semanticscholar +1 more source
Bounds for the extremal eigenvalues of gain Laplacian matrices
, 2021A complex unit gain graph ( T -gain graph), Φ = ( G , φ ) is a graph where the function φ assigns a unit complex number to each orientation of an edge of G, and its inverse is assigned to the opposite orientation.
M. Kannan +2 more
semanticscholar +1 more source
On bounds of A-eigenvalue multiplicity and the rank of a complex unit gain graph
Discrete Mathematics, 2023zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
A bound on the rank of weighted graphs in terms of girth
Linear and multilinear algebraLet $ \tilde {\Phi }=(G,w) $ Φ~=(G,w) be a connected weighted graph and $ A(\tilde {\Phi }) $ A(Φ~) be its adjacency matrix. The rank $ r(G,w) $ r(G,w) of $ \tilde {\Phi } $ Φ~ is defined as the rank of its adjacency matrix $ A(\tilde {\Phi }) $ A(Φ ...
Suliman Khan +2 more
semanticscholar +1 more source
2025 Wave Electronics and its Application in Information and Telecommunication Systems (WECONF)
n the report, modeling and analysis of the defective grounding structure (DGS) were carried out as part of the work to reduce coupling for the developed models of complex structures based on simpler DGS.
V. E. Kutepov, I. V. Peshkov
semanticscholar +1 more source
n the report, modeling and analysis of the defective grounding structure (DGS) were carried out as part of the work to reduce coupling for the developed models of complex structures based on simpler DGS.
V. E. Kutepov, I. V. Peshkov
semanticscholar +1 more source
Discrete Applied Mathematics
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Wu, Qi, Song, Jialei, Lu, Yong
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Wu, Qi, Song, Jialei, Lu, Yong
openaire +2 more sources
On H-joins of complex unit gain graphs and their stability
Discrete MathematicsCallum Huntington +2 more
semanticscholar +1 more source
Spectral fundamentals and characterizations of signed directed graphs
Journal of Combinatorial Theory - Series A, 2022Edwin R Van Dam
exaly
Planar Pose Graph Optimization: Duality, Optimal Solutions, and Verification
IEEE Transactions on robotics, 2016L. Carlone +3 more
semanticscholar +1 more source