Results 41 to 50 of about 4,129,862 (348)
Moore–Penrose inverse of the incidence matrix of a distance regular graph
Let Γ be a graph with n vertices, where each edge is given an orientation and let Q be the vertex-edge incidence matrix. We obtain a formula for the Moore–Penrose inverse of Q, when Γ is a distance regular graph. The formula is illustrated by examples.
A. Azimi, R. Bapat
semanticscholar +1 more source
Extremal Regular Graphs: Independent Sets and Graph Homomorphisms [PDF]
This survey concerns regular graphs that are extremal with respect to the number of independent sets and, more generally, graph homomorphisms. More precisely, in the family of of d-regular graphs, which graph G maximizes/minimizes the quantity i(G)1/v(G),
Yu-Fei Zhao
semanticscholar +1 more source
Regular Partitions of Regular Graphs [PDF]
In the study of the combinatorial structure of edge-graphs of convex polytopes one may ask whether a given graph possesses a partition consisting of certain kinds of subgraphs.In this paper we describe some special partitions of 3-valent and 4-valent graphs.
openaire +2 more sources
A Study of Regular and Irregular Neutrosophic Graphs with Real Life Applications
Fuzzy graph theory is a useful and well-known tool to model and solve many real-life optimization problems. Since real-life problems are often uncertain due to inconsistent and indeterminate information, it is very hard for an expert to model those ...
Liangsong Huang +5 more
doaj +1 more source
Parsing Graphs with Regular Graph Grammars
Recently, several datasets have become available which represent natural language phenomena as graphs. Hyperedge Replacement Languages (HRL) have been the focus of much attention as a formalism to represent the graphs in these datasets.
Sorcha Gilroy, A. Lopez, S. Maneth
semanticscholar +1 more source
20 pages, 6 ...
Primoz Potocnik, Janos Vidali
openaire +6 more sources
Let R be a commutative ring, the Pseudo – Von Neumann regular graph of the ring R is define as a graph whose vertex set consists of all elements of R and any two distinct vertices a and b are adjacent if and only if , this graph is denoted by P-VG(R ...
Nermen J. Khalel, Nabeel E. Arif
doaj +1 more source
Maximizing H‐Colorings of a Regular Graph [PDF]
For graphs G and H, a homomorphism from G to H, or H‐coloring of G, is an adjacency preserving map from the vertex set of G to the vertex set of H. Our concern in this article is the maximum number of H‐colorings admitted by an n‐vertex, d‐regular graph,
David J. Galvin
semanticscholar +1 more source
A graph G=(V,E) is called a unit-distance graph in the plane if there is an injective embedding of V in the plane such that every pair of adjacent vertices are at unit distance apart. If additionally the corresponding edges are non-crossing and all vertices have the same degree r we talk of a regular matchstick graph.
Sascha Kurz, Rom Pinchasi
openaire +3 more sources
On Singular Signed Graphs with Nullspace Spanned by a Full Vector: Signed Nut Graphs
A signed graph has edge weights drawn from the set {+1, −1}, and is sign-balanced if it is equivalent to an unsigned graph under the operation of sign switching; otherwise it is sign-unbalanced.
Bašić Nino +3 more
doaj +1 more source

