Results 61 to 70 of about 3,263,133 (311)
Which Graphs Occur as $$\gamma $$-Graphs? [PDF]
Graphs and Combinatorics, 2020 Comment: 28 pages, 5 figures, 2 appendices.
Matt DeVos +3 more
openaire +2 more sources
Distance-regular Cayley graphs with small valency
, 2019 We consider the problem of which distance-regular graphs with small valency are Cayley graphs. We determine the distance-regular Cayley graphs with valency at most $4$, the Cayley graphs among the distance-regular graphs with known putative intersection ...
Jazaeri, Mojtaba, van Dam, Edwin R.
core +1 more source
Equistable graphs, general partition graphs, triangle graphs, and graph products
Discrete Applied Mathematics, 2011 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Miklavič, Štefko, Milanič, Martin
openaire +1 more source
Graphs of Morphisms of Graphs [PDF]
The Electronic Journal of Combinatorics, 2008 This is an account for the combinatorially minded reader of various categories of directed and undirected graphs, and their analogies with the category of sets. As an application, the endomorphisms of a graph are in this context not only composable, giving a monoid structure, but also have a notion of adjacency, so that the set of endomorphisms is both
Brown, R. +3 more
openaire +2 more sources
IEEE AccessFinancial transaction networks represent inter-firm relationships, where firms and transactions act as nodes and edges, respectively. Link prediction in these networks aims to identify potential future or missing transactions or links, providing valuable
Aparajita Bose, Byunghoon Kim
doaj +1 more source
Resolvent of Large Random Graphs
, 2009 We analyze the convergence of the spectrum of large random graphs to the spectrum of a limit infinite graph. We apply these results to graphs converging locally to trees and derive a new formula for the Stieljes transform of the spectral measure of such ...
Aldous +31 more
core +4 more sources
Cospectrality graphs of Smith graphs
Filomat, 2019 Graphs whose spectrum belongs to the interval [-2,2] are called Smith graphs. The structure of a Smith graph with a given spectrum depends on a system of Diophantine linear algebraic equations. We have established in [1] several properties of this system and showed how it can be simplified and effectively applied.
Cvetković, Dragoš, Todorčević, Vesna
openaire +4 more sources
A Note on Ultrametric Spaces, Minimum Spanning Trees and the Topological Distance Algorithm
Information, 2020 We relate the definition of an ultrametric space to the topological distance algorithm—an algorithm defined in the context of peer-to-peer network applications.
Jörg Schäfer
doaj +1 more source
Therapeutic Apheresis and Dialysis, EarlyView.ABSTRACT Secondary hyperparathyroidism (SHPT) is a common complication in patients receiving maintenance dialysis, driven by calcium and phosphate metabolism disturbances. Calcimimetics are central to the management of SHPT by enhancing calcium‐sensing receptor sensitivity and reducing parathyroid hormone secretion.
Fumihiko Koiwa +3 more
wiley +1 more source
Random graphs from a weighted minor-closed class [PDF]
, 2012 There has been much recent interest in random graphs sampled uniformly from the n-vertex graphs in a suitable minor-closed class, such as the class of all planar graphs.
McDiarmid, Colin
core