Results 1 to 10 of about 2,154 (143)
Some sufficient conditions on hamilton graphs with toughness [PDF]
Frontiers in Computational Neuroscience, 2022 Let G be a graph, and the number of components of G is denoted by c(G). Let t be a positive real number. A connected graph G is t-tough if tc(G − S) ≤ |S| for every vertex cut S of V(G). The toughness of G is the largest value of t for which G is t-tough,
Gaixiang Cai +4 more
doaj +3 more sources
Generalization of (Q,L)-Fuzzy Soft Subhemirings of a Hemiring
Advances in Fuzzy Systems, 2022 This paper investigates the properties and results of (Q,L)-fuzzy soft subhemirings ((Q,L)-FSSHR) of a hemiring R. The motivation behind this study is to utilize the concept of L-fuzzy soft set of a hemiring and to derive a few specific outcomes on (Q, L)
K. Geetha +5 more
doaj +3 more sources
α-Completely Regular and Almost α-Completely Regular Spaces
Mathematical Problems in Engineering, Volume 2022, Issue 1, 2022., 2022 This work is aimed at studying some of the characterizations of α-completely regular and almost α-completely regular spaces through the new concept of α-zero sets and α-continuous functions.
A. Azzam, A. Nasef
semanticscholar +2 more sources
Eigenvalue Localization Inequalities for Complex Matrices With Order n≥3
Advances in Mathematical PhysicsMSC2020 Classification: 15A18, 15A60 ...
Rong Ma, Feng Zhang
doaj +2 more sources
On the Randić energy of caterpillar graphs [PDF]
Match-communications in Mathematical and in Computer Chemistry, 2021 A caterpillar graph T (p1, . . . , pr) of order n = r + ∑r i=1 pi, r ≥ 2, is a tree such that removing all its pendent vertices gives rise to a path of order r.
D. Cardoso +3 more
semanticscholar +1 more source
On Join Operation of Graphs by Obtained Monogenic Semigroups
Turkish journal of mathematics & computer science, 2021 For each commutative ring R we associate a simple graph Γ(R). This relationship presents a link between algebra and graph theory. Our main scope in this study is to extend this study over the special algebraic graphs to join graph operations.
Yasar Nacaroglu
semanticscholar +1 more source
The effect of removing a 2-downer edge or a cut 2-downer edge triangle for an eigenvalue
Special Matrices, 2023 Edges in the graph associated with a square matrix over a field may be classified as to how their removal affects the multiplicity of an identified eigenvalue.
Toyonaga Kenji
doaj +1 more source
Graph complement conjecture for classes of shadow graphs
Operators and Matrices, 2021 The real minimum semidefinite rank of a graph G , denoted mrR+(G) , is defined to be the minimum rank among all real symmetric positive semidefinite matrices whose zero/nonzero pattern corresponds to the graph G .
Monsikarn Jansrang, S. Narayan
semanticscholar +1 more source
On the location of eigenvalues of matrix polynomials [PDF]
Operators and Matrices, 2017 A number λ ∈ C is called an eigenvalue of the matrix polynomial P(z) if there exists a nonzero vector x ∈ Cn such that P(λ)x = 0 . Note that each finite eigenvalue of P(z) is a zero of the characteristic polynomial det(P(z)) .
C. Lê, Thị-Hòa-Bình Dư, T. Nguyen
semanticscholar +1 more source
The smallest singular value of certain Toeplitz-related parametric triangular matrices
Special Matrices, 2021 Let L be the infinite lower triangular Toeplitz matrix with first column (µ, a1, a2, ..., ap, a1, ..., ap, ...)T and let D be the infinite diagonal matrix whose entries are 1, 2, 3, . . . Let A := L + D be the sum of these two matrices.
Solary Maryam Shams +2 more
doaj +1 more source