Results 21 to 30 of about 1,557,851 (153)
On Subtree Number Index of Generalized Book Graphs, Fan Graphs, and Wheel Graphs
With generating function and structural analysis, this paper presents the subtree generating functions and the subtree number index of generalized book graphs, generalized fan graphs, and generalized wheel graphs, respectively.
Daoqiang Sun +4 more
doaj +1 more source
Orientable -distance magic regular graphs
Hefetz, Mütze, and Schwartz conjectured that every connected undirected graph admits an antimagic orientation (Hefetz et al., 2010). In this paper we support the analogous question for distance magic labeling. Let be an Abelian group of order .
Paweł Dyrlaga, Karolina Szopa
doaj +1 more source
D-magic strongly regular graphs
For a set of distances D, a graph G on n vertices is said to be D-magic if there exists a bijection and a constant k such that for any vertex x, where is the D-neighbourhood set of x.
Rinovia Simanjuntak, Palton Anuwiksa
doaj +1 more source
Walk entropies on graphs [PDF]
Entropies based on walks on graphs and on their line-graphs are defined. They are based on the summation over diagonal and off-diagonal elements of the thermal Green’s function of a graph also known as the communicability. The walk entropies are strongly
Estrada, Ernesto +2 more
core +4 more sources
Graphs of intersections of closed polygonal chains
In the paper such subclass of string graphs as intersection graphs of closed polygonal chains (class of CPC-graphs) was considered, necessary conditions for belonging to that class, forbidden subgraphs and operations with graphs which preserve belonging ...
Nikolai P. Prochorov, Ekaterina N. Dul
doaj +1 more source
Fault diagnosability of regular graphs
An interconnection network's diagnosability is an important measure of its self-diagnostic capability. In 2012, Peng et al. proposed a measure for fault diagnosis of the network, namely, the $h$-good-neighbor conditional diagnosability, which requires ...
Mei-Mei Gu, Rong-Xia Hao, Eddie Cheng
doaj +1 more source
Applications of Strongly Regular Cayley Graphs to Codebooks
In this paper, we give a construction of strongly regular Cayley graphs on the finite field $\mathbb {F}_{q^{n}}$ . As applications of these strongly regular Cayley graphs, a class of codebooks is presented and proved to be asymptotically optimal with ...
Qiuyan Wang +3 more
doaj +1 more source
Arithmetic completely regular codes [PDF]
In this paper, we explore completely regular codes in the Hamming graphs and related graphs. Experimental evidence suggests that many completely regular codes have the property that the eigenvalues of the code are in arithmetic progression.
Jacobus Koolen +3 more
doaj +1 more source
b-Coloring of the Mycielskian of Some Classes of Graphs
The b-chromatic number b(G) of a graph G is the maximum k for which G has a proper vertex coloring using k colors such that each color class contains at least one vertex adjacent to a vertex of every other color class.
Raj S. Francis, Gokulnath M.
doaj +1 more source
Recently, a construction of minimal codes arising from a family of almost Ramanujan graphs was shown. Ramanujan graphs are examples of expander graphs that minimize the second-largest eigenvalue of their adjacency matrix.
Valentino Smaldore
doaj +1 more source

