Results 61 to 70 of about 4,129,862 (348)
On orbital regular graphs and frobenius graphs
A group is a Frobenius group if it acts transitively but not freely on a set such that no two elements are fixed by a non-trivial element of the group. An orbital-regular graph is a finite graph whose automorphism group has a subgroup which is transitive on the edges and contains no element which fixes two vertices.
Xin Gui Fang +2 more
openaire +2 more sources
Capturing Topology in Graph Pattern Matching [PDF]
Graph pattern matching is often defined in terms of subgraph isomorphism, an np-complete problem. To lower its complexity, various extensions of graph simulation have been considered instead.
Huai, Jinpeng +11 more
core +1 more source
GIANT VACANT COMPONENT LEFT BY A RANDOM WALK IN A RANDOM d-REGULAR GRAPH [PDF]
We study the trajectory of a simple random walk on a d-regular graph with d 3 and locally tree-like structure as the number n of vertices grows. Examples of such graphs include random d-regular graphs and large girth expanders.
J. Černý, A. Teixeira, David Windisch
semanticscholar +1 more source
Some Properties of Regular Line Graphs
In this paper, the concept of regular line graph has been introduced. The maximum number of vertices with different degrees in the regular line graphs has also been studied.
Akram Attar
doaj +4 more sources
The central vertices and radius of the regular graph of ideals [PDF]
The regular graph of ideals of the commutative ring $R$, denoted by ${Gamma_{reg}}(R)$, is a graph whose vertex set is the set of all non-trivial ideals of $R$ and two distinct vertices $I$ and $J$ are adjacent if and only if either $I$ contains a $
Farzad Shaveisi
doaj +1 more source
Kirchhoff index in line, subdivision and total graphs of a regular graph
Let G be a connected regular graph and l ( G ) , s ( G ) , t ( G ) the line, subdivision, total graphs of G , respectively. In this paper, we derive formulae and lower bounds of the Kirchhoff index of l ( G ) , s ( G ) and t ( G ) , respectively.
Xing Gao, Yan-Feng Luo, Wen-Wen Liu
semanticscholar +1 more source
An inequality involving the second largest and smallest eigenvalue of a distance-regular graph [PDF]
For a distance-regular graph with second largest eigenvalue (resp., smallest eigenvalue) θ 1 (resp., θ D ) we show that ( θ 1 + 1 ) ( θ D + 1 ) ⩽ - b 1 holds, where equality only holds when the diameter equals two. Using this inequality we study distance-
J. Koolen, Jongyook Park, Hyonju Yu
semanticscholar +1 more source
On extension of regular graphs [PDF]
arXiv admin note: substantial text overlap with arXiv:1407 ...
Banerjee, Anirban, Bej, Saptarshi
openaire +2 more sources
Regular factors in regular graphs
The author shows that a \(k\)-regular \((k-1)\)-edge-connected graph with an even number of vertices has an \(m\)-factor not containing \(k-m\) arbitrarily prescribed edges whenever \(1\leq m\leq k-1\). This was known only for \(m=1\) or \(k-1\). Also the sharpness of this result and some corollaries are given.
openaire +3 more sources
Obesity raises blood levels of PAI‐1, a protein linked to metabolic dysfunction‐associated steatotic liver disease in people with obesity. In female mice fed a high‐fat diet, partially lowering PAI‐1 led to smaller subcutaneous fat cells and lower liver cholesterol, without changing body weight or insulin sensitivity.
Claudia E. Ramirez Bustamante +10 more
wiley +1 more source

