Results 31 to 40 of about 3,088,840 (140)
Construction of Multi-Rate QC-LDPC Codes Based on Permutation Method
AxiomsThis paper proposes a systematic permutation-based construction method for multi-rate quasi-cyclic low-density parity-check (QC-LDPC) codes. We first present a graph-theoretic framework in which any regular QC-LDPC code can be normalized to a canonical ...
Hengzhou Xu +4 more
doaj +1 more source
A Method for Testing Graph Visualizations Using Games [PDF]
, 2007 We describe a system that enables us to perform exploratory empirical experiments with graph visualization techniques by incorporating them into games that can be played on an internet site, the Graph Games Website (http://www.cs.kent.ac.uk/projects ...
Bovey, John D., Rodgers, Peter
core +1 more source
Regular graphs with four eigenvalues [PDF]
We study the connected regular graphs with four distinct eigenvalues. Properties and feasibility conditions of the eigenvalues are found. Several examples, constructions and characterizations are given, as well as some uniqueness and nonexistence results.
Dam, E.R. van
core +2 more sources
Application of Symmetric Division Deg Index of Graph Under Fuzzy Environment
International Journal of Computational Intelligence SystemsFuzzy graph theory, renowned for its capacity to manage uncertainty and capture varying degrees of relationships, has surfaced as a powerful framework for modeling and addressing complex problems across diverse domains such as medicine, social networks ...
Umapada Jana, Ganesh Ghorai
doaj +1 more source
Let $G$ be a simple connected graph of order $n$ and $\partial(G)$ is the spectral radius of the distance matrix $D(G)$ of $G$. The transmission $D_i$ of vertex $i$ is the $i$-th row sum of $D(G)$. Denote by $D_{\max}(G)$ the maximum of transmissions over all vertices of $G$, and $\partial^Q(G)$ is the spectral radius of the distance signless Laplacian
Lan, Jingfen, Liu, Lele
openaire +2 more sources
Hamiltonian Strongly Regular Graphs [PDF]
We give a sufficient condition for a distance-regular graph to be Hamiltonian. In particular, the Petersen graph is the only connected non-Hamiltonian strongly regular graph on fewer than 99 vertices.Distance-regular graphs;Hamilton cycles JEL ...
Brouwer, A.E., Haemers, W.H.
core
Performance Guarantees for Distributed Reachability Queries [PDF]
, 2012 In the real world a graph is often fragmented and distributed across different sites. This highlights the need for evaluating queries on distributed graphs.
Wang, Xin +2 more
core
Fundamental Study of the Fill-in Minimization Problem [PDF]
, 1980 In this paper the fill-in minimization problem which arises at the application of the sparse matrix method for a large sparse set of linear equations is discussed from the graph-theoretic viewpoint and also through the numerical experiments.
Numata, Katsu, Taniguchi, Takeo
core +1 more source
Strongly Regular Graphs with Maximal Energy [PDF]
The energy of a graph is the sum of the absolute values of the eigenvalues of its adjacency matrix. Koolen and Moulton have proved that the energy of a graph on n vertices is at most n(1 + √n)/2, and that equality holds if and only if the graph is ...
Haemers, W.H.
core
Representation and generation of plans using graph spectra [PDF]
, 2007 Numerical comparison of spaces with one another is often achieved with set scalar measures such as global and local integration, connectivity, etc., which capture a particular quality of the space but therefore lose much of the detail of its overall ...
Hanna, S.
core