Results 1 to 10 of about 2,691 (126)
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
Spektrum Laplace pada graf kincir angin berarah (Q_k^3)
Majalah Ilmiah Matematika dan Statistika, 2022 Suppose that 0 = µ0 ≤ µ1 ≤ ... ≤ µn-1 are eigen values of a Laplacian matrix graph with n vertices and m(µ0), m(µ1), …, m(µn-1) are the multiplicity of each µ, so the Laplacian spectrum of a graph can be expressed as a matrix 2 × n whose line elements ...
Melly Amaliyanah +2 more
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
Signless normalized Laplacian for hypergraphs [PDF]
Electronic Journal of Graph Theory and Applications, 2020 The spectral theory of the normalized Laplacian for chemical hypergraphs is further inves-tigated. The signless normalized Laplacian is introduced and it is shown that its spectrum for classical hypergraphs coincides with the spectrum of the normalized ...
E. Andreotti, R. Mulas
semanticscholar +1 more source
Inverse Sum Status Energy of a Graph
International Journal for Research in Applied Science and Engineering Technology, 2021 Motivated by the inverse sum status index, we introduce the inverse sum status matrix ISS={■((σ_u σ_v)/((σ_u+σ_v ) ) if u_i~v_j,@0 otherwise)┤ Thus we also obtained the results for well known graphs. Keywords: Inverse sum status energy, Inverse Sum Indeg
K. N. Prakasha
semanticscholar +1 more source
Electronic Journal of Graph Theory and Applications, 2021 The d-Fibonacci digraphs F (d, k), introduced here, have the number of vertices following some generalized Fibonacci-like sequences. They can be defined both as digraphs on alphabets and as iterated line digraphs.
C. Dalfó, M. A. Fiol
semanticscholar +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
Steiner distance matrix of caterpillar graphs
Special Matrices, 2022 In this article, we show that the rank of the 2-Steiner distance matrix of a caterpillar graph having NN vertices and pp pendant veritices is 2N−p−12N-p-1.
Azimi Ali +2 more
doaj +1 more source
More on Signed Graphs with at Most Three Eigenvalues
Discussiones Mathematicae Graph Theory, 2022 We consider signed graphs with just 2 or 3 distinct eigenvalues, in particular (i) those with at least one simple eigenvalue, and (ii) those with vertex-deleted subgraphs which themselves have at most 3 distinct eigenvalues.
Ramezani Farzaneh +2 more
doaj +1 more source
Degree Sum Condition for the Existence of Spanning k-Trees in Star-Free Graphs
Discussiones Mathematicae Graph Theory, 2022 For an integer k ≥ 2, a k-tree T is defined as a tree with maximum degree at most k. If a k-tree T spans a graph G, then T is called a spanning k-tree of G.
Furuya Michitaka +5 more
doaj +1 more source