Results 61 to 70 of about 16,950 (147)
, 2017 For a graph, the general zeroth-order Randić index R0 α is defined as the sum of the αth power of the vertex degrees (α 6= 0, α 6= 1). Let Hn be the class of all maximal outerplanar graphs on n vertices, and Tn,k be the class of trees with n vertices of ...
Guifu Su +4 more
semanticscholar +1 more source
Random graphs embeddable in order‐dependent surfaces
Random Structures &Algorithms, Volume 64, Issue 4, Page 940-985, July 2024.Abstract Given a ‘genus function’ g=g(n)$$ g=g(n) $$, we let Eg$$ {\mathcal{E}}^g $$ be the class of all graphs G$$ G $$ such that if G$$ G $$ has order n$$ n $$ (i.e., has n$$ n $$ vertices) then it is embeddable in a surface of Euler genus at most g(n)$$ g(n) $$.
Colin McDiarmid, Sophia Saller
wiley +1 more source
A Self-stabilizing Algorithm for Locating the Center of Maximal Outerplanar Graphs
Journal of universal computer science (Online), 2014 Self-stabilizing algorithms model distributed systems, which automatically recover from transient failures in the state of the system. The center of a graph comprises a set of vertices with minimum eccentricity.
M. Panczyk, H. Bielak
semanticscholar +1 more source
On tree decompositions whose trees are minors
Journal of Graph Theory, Volume 106, Issue 2, Page 296-306, June 2024.Abstract In 2019, Dvořák asked whether every connected graph G $G$ has a tree decomposition ( T , B ) $(T,{\rm{ {\mathcal B} }})$ so that T $T$ is a subgraph of G $G$ and the width of ( T , B ) $(T,{\rm{ {\mathcal B} }})$ is bounded by a function of the treewidth of G $G$.
Pablo Blanco +5 more
wiley +1 more source
, 2016 We prove that every 3-connected planar graph on $n$ vertices contains an induced path on $\Omega(\log n)$ vertices, which is best possible and improves the best known lower bound by a multiplicative factor of $\log \log n$.
Esperet, Louis +2 more
core +3 more sources
Conference on Computer Science and Information Systems, 2014 —Self-stabilizing algorithms model distributed systems and allow automatic recovery of the system from transient failures. The center of a graph is the set of vertices with the minimum eccentricity.
H. Bielak, M. Panczyk
semanticscholar +1 more source
The product structure of squaregraphs
Journal of Graph Theory, Volume 105, Issue 2, Page 179-191, February 2024.Abstract A squaregraph is a plane graph in which each internal face is a 4‐cycle and each internal vertex has degree at least 4. This paper proves that every squaregraph is isomorphic to a subgraph of the semistrong product of an outerplanar graph and a path.
Robert Hickingbotham +3 more
wiley +1 more source
Equal Entries in Totally Positive Matrices [PDF]
, 2013 We show that the maximal number of equal entries in a totally positive (resp. totally nonsingular) $n\textrm{-by-}n$ matrix is $\Theta(n^{4/3})$ (resp. $\Theta(n^{3/2}$)).
Farber, Miriam +3 more
core
The role of twins in computing planar supports of hypergraphs
, 2020 A support or realization of a hypergraph $H$ is a graph $G$ on the same vertex as $H$ such that for each hyperedge of $H$ it holds that its vertices induce a connected subgraph of $G$.
Kanj, Iyad A. +4 more
core
Eternal vertex cover number of maximal outerplanar graphs
, 2022 Eternal vertex cover problem is a variant of the classical vertex cover problem modeled as a two player attacker-defender game. Computing eternal vertex cover number of graphs is known to be NP-hard in general and the complexity status of the problem for bipartite graphs is open.
Babu, Jasine +3 more
openaire +2 more sources