Results 1 to 10 of about 175 (106)
Some sufficient conditions on hamilton graphs with toughness [PDF]
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 +2 more sources
α‐Completely Regular and Almost α‐Completely Regular Spaces
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. 2010 Mathematics Subject Classification: primary 05C38, 15A15; Secondary 05A15, 15A18.
A.A. Azzam, A.A. Nasef, Cenap Özel
wiley +1 more source
Generalization of (Q,L)‐Fuzzy Soft Subhemirings of a Hemiring
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)‐FSSHR.
K. Geetha+6 more
wiley +1 more source
Reproducibility of serum testing for environmental allergen‐specific IgE in dogs in Europe
Background – Serum testing for allergen‐specific immunoglobulin (Ig)E is commonly employed to identify allergens used for allergen‐specific immunotherapy in dogs, yet the reliability of results has been a matter of debate. Objective – The aim of this study was to evaluate the reproducibility of serum tests for environmental allergen‐specific IgE in ...
Katja N. Baumann+4 more
wiley +1 more source
Corrigendum to “Spectra universally realizable by doubly stochastic matrices”
We correct an error in the statement and the proof of Theorem 2.1 and Corollary 2.1 in our previous study [Spec. Matrices 6 (2018), 301–309], Section 2: On nonnegative matrices similar to positive matrices.
Collao Macarena+2 more
doaj +1 more source
Given a real number a ≥ 1, let Kn(a) be the set of all n × n unit lower triangular matrices with each element in the interval [−a, a]. Denoting by λn(·) the smallest eigenvalue of a given matrix, let cn(a) = min {λ n(YYT) : Y ∈ Kn(a)}.
Altınışık Ercan
doaj +1 more source
An ℋ-tensor-based criteria for testing the positive definiteness of multivariate homogeneous forms
A positive definite homogeneous multivariate form plays an important role in the field of optimization, and positive definiteness of the form can be identified by a special structured tensor.
Bai Dongjian, Wang Feng
doaj +1 more source
A recursive condition for the symmetric nonnegative inverse eigenvalue problem
In this paper we present a sufficient ondition and a necessary condition for Symmetri Nonnegative Inverse Eigenvalue Problem. This condition is independent of the existing realizability criteria.
Elvis Ronald Valero+2 more
doaj +1 more source
Computing Laplacian energy, Laplacian-energy-like invariant and Kirchhoff index of graphs
Let G be a simple connected graph of order n and size m. The matrix L(G)= D(G)− A(G) is called the Laplacian matrix of the graph G,where D(G) and A(G) are the degree diagonal matrix and the adjacency matrix, respectively.
Bhatnagar S., Merajuddin, Pirzada S.
doaj +1 more source
Bounds on Nirmala energy of graphs
The Nirmala matrix of a graph and its energy have recently defined. In this paper, we establish some features of the Nirmala eigenvalues. Then we propose various bounds on the Nirmala spectral radius and energy. Moreover, we derive a bound on the Nirmala
Yalçin N. Feyza
doaj +1 more source