Results 51 to 60 of about 4,129,862 (348)

Nim-Regularity of Graphs [PDF]

open access: yesThe Electronic Journal of Combinatorics, 1999
Ehrenborg and Steingrímsson defined simplicial Nim, and defined Nim-regular complexes to be simplicial complexes for which simplicial Nim has a particular type of winning strategy. We completely characterize the Nim-regular graphs by the exclusion of two vertex-induced subgraphs, the graph on three vertices with one edge and the graph on five ...
openaire   +2 more sources

Extending Graph Pattern Matching with Regular Expressions

open access: yes, 2020
Graph pattern matching, which is to compute the set M(Q, G) of matches of Q in G, for the given pattern graph Q and data graph G, has been increasingly used in emerging applications e.g., social network analysis.
Xin Wang   +9 more
core   +1 more source

Covering Regular Graphs

open access: yesJournal of Combinatorial Theory, Series B, 1997
A covering projection from a graph \(G\) onto a graph \(H\) is a ``local isomorphism'': a mapping from the vertex set of \(G\) onto the vertex set of \(H\) such that, for every \(v\in V(G)\), the neighborhood of \(v\) is mapped bijectively onto the neighborhood (in \(H\)) of the image of \(v\).
Jan Kratochvíl   +2 more
openaire   +1 more source

Regular graph construction for semi-supervised learning

open access: yesJournal of Physics, Conference Series, 2014
Semi-supervised learning (SSL) stands out for using a small amount of labeled points for data clustering and classification. In this scenario graph-based methods allow the analysis of local and global characteristics of the available data by identifying ...
D. Vega-Oliveros   +4 more
semanticscholar   +1 more source

Fundamental Study of the Fill-in Minimization Problem [PDF]

open access: yes, 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

Zero-sum flow number of categorical and strong product of graphs [PDF]

open access: yesTransactions on Combinatorics, 2020
A zero-sum flow is an assignment of nonzero integers to the edges such that the sum of the values of all edges incident with each vertex is zero, and we call it a zero-sum $k$-flow if the absolute values of edges are less than $k$. We define the zero-sum
Muhammad Aamer Rashid   +4 more
doaj   +1 more source

The matching polynomial of a distance-regular graph

open access: yesInternational Journal of Mathematics and Mathematical Sciences, 2000
A distance-regular graph of diameter d has 2d intersection numbers that determine many properties of graph (e.g., its spectrum). We show that the first six coefficients of the matching polynomial of a distance-regular graph can also be determined from ...
Robert A. Beezer, E. J. Farrell
doaj   +1 more source

On regular graphs. II

open access: yesJournal of Combinatorial Theory, Series B, 1971
AbstractThis paper is a continuation of [1] and we shall use the same terminology. The main result of this part is the following: Suppose that the automorphism group of a connected graph of valency p + 1, p a prime, has a subgroup which acts as a regular permutation group on the set of s-arcs of the graph. Then s ≤ 7 and s ≠ 6.
openaire   +4 more sources

A note on the problem of finding a (3,9)-cage

open access: yesInternational Journal of Mathematics and Mathematical Sciences, 1985
In this paper, we discuss The poblem of finding a (3,9)-cage. A hamiltonian graph with girth 9 and 54 vertices is given. Except four vertices, each of the remaining vertices of this graph has valency Three.
P. K. Wong
doaj   +1 more source

Edge Regular Graph Products

open access: yesElectronic Journal of Combinatorics, 2013
A regular nonempty graph $\Gamma$ is called edge regular , whenever there exists a nonegative integer $\lambda_{\Gamma}$, such that any two adjacent vertices of $\Gamma$ have precisely $\lambda_{\Gamma}$ common neighbours.
Bostjan Frelih, Štefko Miklavič
semanticscholar   +1 more source

Home - About - Disclaimer - Privacy