Results 71 to 80 of about 1,557,851 (153)

Regular subgraphs of linear extension graphs [PDF]

open access: yesМатематичні Студії, 2011
The paper deals with the properties of regular subgraphs of linear extension graphs. We obtain a necessary and sufficient condition for regularity of linear extension graphs, prove a pro- position on cardinality and degree partition of special linear ...
O. S. Bondarenko
doaj  

Graphs with Clusters Perturbed by Regular Graphs—Aα-Spectrum and Applications

open access: yesDiscussiones Mathematicae Graph Theory, 2020
Given a graph G, its adjacency matrix A(G) and its diagonal matrix of vertex degrees D(G), consider the matrix Aα (G) = αD(G) + (1 − α)A(G), where α ∈ [0, 1).
Cardoso Domingos M.   +2 more
doaj   +1 more source

On Almost Distance-Regular Graphs [PDF]

open access: yes
2010 Mathematics Subject Classification: 05E30, 05C50;distance-regular graph;walk-regular graph;eigenvalues;predistance ...
Fiol, M.A.   +4 more
core  

It Is Better to Be Semi-Regular When You Have a Low Degree

open access: yesEntropy
We study the algebraic connectivity for several classes of random semi-regular graphs. For large random semi-regular bipartite graphs, we explicitly compute both their algebraic connectivity as well as the full spectrum distribution. For an integer d∈3,7,
Theodore Kolokolnikov
doaj   +1 more source

Handicap Labelings of 4-Regular Graphs

open access: yesAdvances in Electrical and Electronic Engineering, 2017
Let G be a simple graph, let f : V(G)→{1,2,...,|V(G)|} be a bijective mapping. The weight of v ∈ V(G) is the sum of labels of all vertices adjacent to v. We say that f is a distance magic labeling of G if the weight of every vertex is the same
Petr Kovar   +3 more
doaj   +1 more source

The k-conversion number of regular graphs

open access: yesAKCE International Journal of Graphs and Combinatorics, 2020
Given a graph and a set an irreversible k -threshold conversion process on G is an iterative process wherein, for each St is obtained from by adjoining all vertices that have at least k neighbors in We call the set S0 the seed set of the process, and ...
Christina M. Mynhardt, Jane L. Wodlinger
doaj   +1 more source

Distance mean-regular graphs [PDF]

open access: yes, 2016
We introduce the concept of distance mean-regular graph, which can be seen as a generalization of both vertex-transitive and distance-regular graphs. Let G be a graph with vertex set V , diameter D, adjacency matrix A, and adjacency algebra A. Then, G is
Diego, Victor, Fiol Mora, Miquel Àngel
core   +1 more source

Graphs with Few Eigenvalues. An Interplay between Combinatorics and Algebra. [PDF]

open access: yes
: Two standard matrix representations of a graph are the adjacency matrix and the Laplace matrix. The eigenvalues of these matrices are interesting parameters of the graph.
Dam, E.R. van
core  

On supermagic regular graphs [PDF]

open access: yes, 2000
summary:A graph is called supermagic if it admits a labelling of the edges by pairwise different consecutive positive integers such that the sum of the labels of the edges incident with a vertex is independent of the particular vertex. Some constructions
Ivančo, Jaroslav
core   +1 more source

Home - About - Disclaimer - Privacy