Results 51 to 60 of about 16,950 (147)
Tight Distance Query Reconstruction for Trees and Graphs Without Long Induced Cycles
Random Structures &Algorithms, Volume 66, Issue 4, July 2025.ABSTRACT Given access to the vertex set V$$ V $$ of a connected graph G=(V,E)$$ G=\left(V,E\right) $$ and an oracle that given two vertices u,v∈V$$ u,v\in V $$, returns the shortest path distance between u$$ u $$ and v$$ v $$, how many queries are needed to reconstruct E$$ E $$?
Paul Bastide, Carla Groenland
wiley +1 more source
Geometric Assortative Growth Model for Small‐World Networks
The Scientific World Journal, Volume 2014, Issue 1, 2014., 2014 It has been shown that both humanly constructed and natural networks are often characterized by small‐world phenomenon and assortative mixing. In this paper, we propose a geometrically growing model for small‐world networks. The model displays both tunable small‐world phenomenon and tunable assortativity.
Yilun Shang, H. M. Chamberlin, Y. Zhang
wiley +1 more source
Total domination in maximal outerplanar graphs
Discrete Applied Mathematics, 2017 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Dorfling, Michael +2 more
openaire +1 more source
On vertex‐transitive graphs with a unique hamiltonian cycle
Journal of Graph Theory, Volume 108, Issue 1, Page 65-99, January 2025.Abstract A graph is said to be uniquely hamiltonian if it has a unique hamiltonian cycle. For a natural extension of this concept to infinite graphs, we find all uniquely hamiltonian vertex‐transitive graphs with finitely many ends, and also discuss some examples with infinitely many ends.
Babak Miraftab, Dave Witte Morris
wiley +1 more source
, 2001 A {\it cluster of cycles} (or {\it $(r,q)$-polycycle}) is a simple planar 2--co nnected finite or countable graph $G$ of girth $r$ and maximal vertex-degree $q$, which admits {\it $(r,q)$-polycyclic realization} on the plane, denote it by $P(G)$, i.e ...
Archdeacon +15 more
core +2 more sources
Double domination in maximal outerplanar graphs
, 2021 In a graph $G$, a vertex dominates itself and its neighbors. A subset $S\subseteq V(G)$ is said to be a double dominating set of $G$ if $S$ dominates every vertex of $G$ at least twice. The double domination number $ _{\times 2}(G)$ is the minimum cardinality of a double dominating set of $G$.
openaire +2 more sources
On the Hub Number of Ring Graphs and Their Behavior Under Graph Operations
International Journal of Mathematics and Mathematical Sciences, Volume 2025, Issue 1, 2025.This study examines the hub number of ring graphs and investigates their behavior under operations such as union, intersection, and join. Different findings for this parameter are found for a variety of types of ring graphs, such as commutative ring graphs, path ring graphs, complete ring graphs, cycle ring graphs, and star ring graphs, for which the ...
Mohammed Alsharafi +3 more
wiley +1 more source
Self‐avoiding walks and polygons on hyperbolic graphs
Journal of Graph Theory, Volume 106, Issue 3, Page 435-473, July 2024.Abstract We prove that for the d $d$‐regular tessellations of the hyperbolic plane by k $k$‐gons, there are exponentially more self‐avoiding walks of length n $n$ than there are self‐avoiding polygons of length n $n$. We then prove that this property implies that the self‐avoiding walk is ballistic, even on an arbitrary vertex‐transitive graph ...
Christoforos Panagiotis
wiley +1 more source
A study of upper ideal relation graphs of rings
AKCE International Journal of Graphs and CombinatoricsLet R be a ring with unity. The upper ideal relation graph [Formula: see text] of the ring R is the simple undirected graph whose vertex set is the set of all non-unit elements of R and two distinct vertices x, y are adjacent if and only if there exists ...
Barkha Baloda +2 more
doaj +1 more source
Small Superpatterns for Dominance Drawing
, 2013 We exploit the connection between dominance drawings of directed acyclic graphs and permutations, in both directions, to provide improved bounds on the size of universal point sets for certain types of dominance drawing and on superpatterns for certain ...
Bannister, Michael J. +2 more
core +1 more source