Results 31 to 40 of about 1,353 (111)
Special Matrices, 2019 Given a combinatorially symmetric matrix A whose graph is a tree T and its eigenvalues, edges in T can be classified in four categories, based upon the change in geometric multiplicity of a particular eigenvalue, when the edge is removed.
Toyonaga Kenji
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
Another construction of edge-regular graphs with regular cliques
, 2018 We exhibit a new construction of edge-regular graphs with regular cliques that are not strongly regular. The infinite family of graphs resulting from this construction includes an edge-regular graph with parameters $(24,8,2)$.
Greaves, Gary R. W., Koolen, J. H.
core +1 more source
On Double-Star Decomposition of Graphs
Discussiones Mathematicae Graph Theory, 2017 A tree containing exactly two non-pendant vertices is called a double-star. A double-star with degree sequence (k1 + 1, k2 + 1, 1, . . . , 1) is denoted by Sk1,k2. We study the edge-decomposition of graphs into double-stars.
Akbari Saieed +3 more
doaj +1 more source
Gaps in the Saturation Spectrum of Trees
Discussiones Mathematicae Graph Theory, 2019 A graph G is H-saturated if H is not a subgraph of G but the addition of any edge from the complement of G to G results in a copy of H. The minimum number of edges (the size) of an H-saturated graph on n vertices is denoted sat(n,H), while the maximum ...
Horn Paul +3 more
doaj +1 more source
On death processes and urn models [PDF]
Discrete Mathematics & Theoretical Computer Science, 2012 We use death processes and embeddings into continuous time in order to analyze several urn models with a diminishing content. In particular we discuss generalizations of the pill's problem, originally introduced by Knuth and McCarthy, and generalizations
Markus Kuba, Alois Panholzer
doaj +1 more source
Automorphisms of the Planar Tree Power Series Algebra and the Non-Associative Logarithm [PDF]
, 2004 2000 Mathematics Subject Classification: 17A50, 05C05.In this note we present the formula for the coefficients of the substitution series f(g(x)) of planar tree power series g(x) into f(x)
Gerritzen, L.
core
Veterinary Dermatology, EarlyView.ABSTRACT Background Canine atopic dermatitis (cAD) is a multifactorial, inherited skin disease, estimated to affect ≤ 15% of dogs. Studies of skin messenger mRNA in cAD currently use invasive methods, including blood sampling and biopsy collection, whilst advances in human atopic dermatitis study methodology have demonstrated reliable use of minimally ...
Xavier Langon +5 more
wiley +1 more source
Packing Coloring of Some Undirected and Oriented Coronae Graphs
Discussiones Mathematicae Graph Theory, 2017 The packing chromatic number χρ(G) of a graph G is the smallest integer k such that its set of vertices V(G) can be partitioned into k disjoint subsets V1, . . . , Vk, in such a way that every two distinct vertices in Vi are at distance greater than i in
Laïche Daouya +2 more
doaj +1 more source
The structure fault tolerance of burnt pancake networks
Open Mathematics, 2023 One of the symbolic parameters to measure the fault tolerance of a network is its connectivity. The HH-structure connectivity and HH-substructure connectivity extend the classical connectivity and are more practical.
Ge Huifen, Ye Chengfu, Zhang Shumin
doaj +1 more source