Results 21 to 30 of about 3,967,804 (356)

On subgroups product graph of finite groups [PDF]

open access: yesBIO Web of Conferences
This paper explores Subgroup Product Graphs (SPG) in cyclic groups, presenting a Vertex Degrees Formula based on the prime factorization of a positive integer n.
Abd Shakir Jawad, Shelash Hayder B.
doaj   +1 more source

Self-locking degree-4 vertex origami structures [PDF]

open access: yesProceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences, 2016
A generic degree-4 vertex (4-vertex) origami possesses one continuous degree-of-freedom for rigid folding, and this folding process can be stopped when two of its facets bind together. Such facet-binding will induceself-lockingso that the overall structure stays at a pre-specified configuration without additional locking elements or actuators.
Hongbin Fang, Suyi Li, K. W. Wang
openaire   +3 more sources

Euler tours in hypergraphs [PDF]

open access: yes, 2020
We show that a quasirandom $k$-uniform hypergraph $G$ has a tight Euler tour subject to the necessary condition that $k$ divides all vertex degrees.
Glock, Stefan   +3 more
core   +2 more sources

On Triangulations with High Vertex Degree [PDF]

open access: yesAnnals of Combinatorics, 2008
We solve three enumerative problems concerning families of planar maps. More precisely, we establish algebraic equations for the generating function of non-separable triangulations in which all vertices have degree at least d, for a certain value d chosen in {3, 4, 5}.
openaire   +2 more sources

On second Zagreb index and coindex of some derived graphs [PDF]

open access: yesKragujevac Journal of Science, 2015
The second Zagreb index is defined as the sum of the products of the degrees of adjacent vertices. In this note, we examine the second Zagreb indices of some derived graphs and find expressions for these in terms of vertex degrees.
Bommanahal Basavanagoud   +2 more
doaj   +1 more source

On percolation in random graphs with given vertex degrees [PDF]

open access: yes, 2008
We study the random graph obtained by random deletion of vertices or edges from a random graph with given vertex degrees. A simple trick of exploding vertices instead of deleting them, enables us to derive results from known results for random graphs ...
S. Janson
semanticscholar   +1 more source

Almost sure convergence of vertex degree densities in the vertex splitting model [PDF]

open access: yesStochastic Models, 2016
1 ...
Stefánsson, Sigurdur Örn   +1 more
openaire   +2 more sources

LINE REGULAR FUZZY SEMIGRAPHS

open access: yesمجلة بغداد للعلوم, 2023
           This paper introduce two types of edge degrees (line degree and near line degree) and total edge degrees (total line degree and total near line degree) of an edge in a fuzzy semigraph, where a fuzzy semigraph is defined as (V, σ, μ, η ...
ARCHANA S., PREETHI KUTTIPULACKAL
doaj   +1 more source

On limit distributions of vertex degrees in a configuration graph

open access: yesTransactions of the Karelian Research Centre of the Russian Academy of Sciences, 2015
The configuration graph where vertex degrees are independent identically distributed random variables is often used for  models of complex networks such as the Internet. We consider a random graph consisting of   N+1 vertices.
Irina Cheplyukova
doaj   +1 more source

Conjecture Involving Arithmetic-Geometric and Geometric-Arithmetic Indices

open access: yesDiscrete Dynamics in Nature and Society, 2022
The geometric-arithmetic (GA) index of a graph G is the sum of the ratios of geometric and arithmetic means of end-vertex degrees of edges of G. Similarly, the arithmetic-geometric (AG) index of G is defined. Recently, Vujošević et al. conjectured that a
Zainab Alsheekhhussain   +3 more
doaj   +1 more source

Home - About - Disclaimer - Privacy