Results 41 to 50 of about 1,557,851 (153)

Existence of Regular Nut Graphs for Degree at Most 11

open access: yesDiscussiones Mathematicae Graph Theory, 2020
A nut graph is a singular graph with one-dimensional kernel and corresponding eigenvector with no zero elements. The problem of determining the orders n for which d-regular nut graphs exist was recently posed by Gauci, Pisanski and Sciriha.
Fowler Patrick W.   +4 more
doaj   +1 more source

On induced matchings as star complements in regular graphs [PDF]

open access: yes, 2012
We determine all the finite regular graphs which have an induced matching or a cocktail party graph as a star ...
Rowlinson, Peter
core   +1 more source

Some Results on Pendant Regular Graphs

open access: yesPan-American Journal of Mathematics, 2023
Let G = (V, E) be a simple connected graph with o(G) = n and s(G) = m. A graph with pendant vertices is called Pendant Graphs or simply P-Graphs. In this paper we define the regularity of Pendant Graphs w.r.t.
Suji Elizabeth Mathew   +1 more
doaj   +1 more source

Signed star (k,k)-domatic number of a graph [PDF]

open access: yesOpuscula Mathematica, 2014
Let \(G\) be a simple graph without isolated vertices with vertex set \(V(G)\) and edge set \(E(G)\) and let \(k\) be a positive integer. A function \(f:E(G)\longrightarrow \{-1, 1\}\) is said to be a signed star \(k\)-dominating function on \(G\) if ...
S. M. Sheikholeslami, L. Volkmann
doaj   +1 more source

Some applications of matching theorems [PDF]

open access: yes, 2010
PhDThis thesis contains the results of two investigations. The rst concerns the 1- factorizability of regular graphs of high degree. Chetwynd and Hilton proved in 1989 that all regular graphs of order 2n and degree 2n where > 1 2 ( p 7 1) 0 ...
Vaughan, Emil Richard
core   +2 more sources

Non-Isolated Resolving Sets of Corona Graphs with Some Regular Graphs

open access: yesMathematics, 2022
Let G be a connected, simple, and finite graph. For an ordered set W={w1,w2,…,wk}⊆V(G) and a vertex v of G, the representation of v with respect to W is the k-vector r(v|W)=(dG(v,w1),…,dG(v,wk)).
Wahyuni Abidin   +2 more
doaj   +1 more source

On the approximability of the maximum induced matching problem [PDF]

open access: yes, 2005
In this paper we consider the approximability of the maximum induced matching problem (MIM). We give an approximation algorithm with asymptotic performance ratio <i>d</i>-1 for MIM in <i>d</i>-regular graphs, for each <i>d ...
Zito, Michele   +11 more
core   +1 more source

Evolution of Cooperation for Multiple Mutant Configurations on All Regular Graphs with N ≤ 14 Players

open access: yesGames, 2020
We study the emergence of cooperation in structured populations with any arrangement of cooperators and defectors on the evolutionary graph. In a computational approach using structure coefficients defined for configurations describing such arrangements ...
Hendrik Richter
doaj   +1 more source

End-Completely-Regular and End-Inverse Lexicographic Products of Graphs

open access: yesThe Scientific World Journal, 2014
A graph X is said to be End-completely-regular (resp., End-inverse) if its endomorphism monoid End(X) is completely regular (resp., inverse). In this paper, we will show that if X[Y] is End-completely-regular (resp., End-inverse), then both X and Y are ...
Hailong Hou, Rui Gu
doaj   +1 more source

Generation of strongly regular graphs from quaternary complex Hadamard matrices

open access: yesCeylon Journal of Science, 2018
A strongly regular graph with parameters (v, k, μ, λ) is a regular graph G with v vertices and k degree in which every two adjacent vertices have λ common neighbors and every two non-adjacent vertices have μ common neighbors. In this paper, we propose an
W. V. Nishadi   +3 more
doaj   +1 more source

Home - About - Disclaimer - Privacy