Results 11 to 20 of about 587,527 (280)
Strongly Regular Graphs Constructed from $p$-ary Bent Functions [PDF]
Journal of Algebraic Combinatorics, 2010 In this paper, we generalize the construction of strongly regular graphs in [Y. Tan et al., Strongly regular graphs associated with ternary bent functions, J. Combin.Theory Ser.
Chee Yin, De Zhang, Tan Xian, Yeow Meng
core +3 more sources
On Subtree Number Index of Generalized Book Graphs, Fan Graphs, and Wheel Graphs
Journal of Mathematics, 2021 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
AKCE International Journal of Graphs and Combinatorics, 2021 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
Matchings in regular graphs: minimizing the partition function [PDF]
Transactions on Combinatorics, 2021 For a graph $G$ on $v(G)$ vertices let $m_k(G)$ denote the number of matchings of size $k$, and consider the partition function $M_{G}(\lambda)=\sum_{k=0}^nm_k(G)\lambda^k$.
Márton Borbényi, Peter Csikvari
doaj +1 more source
Graphs of intersections of closed polygonal chains
Журнал Белорусского государственного университета: Математика, информатика, 2021 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
Formalized Mathematics, 2023 Abstract In this article regular graphs, both directed and undirected, are formalized in the Mizar system [7], [2], based on the formalization of graphs as described in [10]. The handshaking lemma is also proven.
openaire +2 more sources
D-magic strongly regular graphs
AKCE International Journal of Graphs and Combinatorics, 2020 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
Geometric aspects of 2-walk-regular graphs [PDF]
, 2013 A $t$-walk-regular graph is a graph for which the number of walks of given length between two vertices depends only on the distance between these two vertices, as long as this distance is at most $t$. Such graphs generalize distance-regular graphs and $t$
Cámara, Marc +3 more
core +1 more source
Fault diagnosability of regular graphs
Theory and Applications of Graphs, 2020 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
INDUCED REGULAR PERFECT GRAPHS
South East Asian J. of Mathematics and Mathematical Sciences, 2023 A graph G is said to be R-perfect if, for all induced subgraphs H of G, the induced regular independence number of each induced subgraph H is equal to its corresponding induced regular cover. Here, the induced regular independence number is the maximum number of vertices in H such that no two belong to the same induced regular subgraph in H, and the ...
Jayakumar, Gokul S., V., Sangeetha
openaire +2 more sources