WebConnected signed graphs of fixed order, size, and number of negative edges with maximal index. Linear and Multilinear Algebra, Vol. 65, Issue. 11, p. 2187. CrossRef; Google Scholar; ... Some Upper Bounds for the Net Laplacian Index of a Signed Graph. Bulletin of the Iranian Mathematical Society, Vol. 48, Issue. 1, p. 243. CrossRef; WebIn this paper we introduce the notion of best swap for a failing edge of a single source shortest paths tree (SPT) S (r) rooted in r in a weighted graph G=(V, E). Given an edge e∈ S (r), an edge e¢ Î E {e e'∈ E \\ left {e\ right\} is a swap edge if the swap tree S e\ e¢(r) S_ e \ e'\ left (r\ right) obtained by swapping e with e′ in S (r) is a spanning tree of G.
[2101.01503] Signed graphs with maximal index - arXiv.org
WebSigned graphs with maximal index, with A. Majidi, Discrete Math. 344 (2024), 112463, ... Maximal graphs with respect to rank, with H. Esmailian, S. Hossein Ghorban, G.B. Khosrovshahi, Discrete Math. 344 (2024), 112191, 11 pp. See here for the data sets of maximal graphs reported in the paper. Webversing the sign of vectors whose indices belong to N. If Srepresents a signed graph G_, then S0obviously represents some signed graph, say H_ . ... If G_ is a maximal exceptional signed graph, then it has a representation in E 8, and consequently it … teacheconomy wie reagieren angebot
Signed bicyclic graphs with minimal index - azaruniv.ac.ir
WebFeb 7, 2024 · AbstractIn this paper our focus is on regular signed graphs with exactly 3 (distinct) eigenvalues. We establish certain basic results; for example, we show that they are walk-regular. We also give some constructions and determine all the signed graphs with 3 eigenvalues, under the constraint that they are either signed line graphs or have vertex … WebJan 5, 2024 · In this paper, we show that every (2n-1 + 1)-vertex induced subgraph of the n-dimensional cube graph has maximum degree at least n. This is the best possible result, … WebApr 30, 2024 · Some calculation results on the Wiener complexity and the Wiener index of fullerene graphs of order n ≤ 232 and IPR fullerene graphs of order n ≤ 270 are presented. The structure of graphs with the maximal Wiener complexity or the maximal Wiener index is discussed, and formulas for the Wiener index of several families of graphs are obtained. teacheater roblox generator