Results 11 to 20 of about 1,312,788 (294)
The Average Covering Number of a Graph
Journal of Applied Mathematics, 2013 There are occasions when an average value of a graph parameter gives more useful information than the basic global value. In this paper, we introduce the concept of the average covering number of a graph (the covering number of a graph is the minimum ...
Derya Dogan, Pinar Dundar
doaj +2 more sources
Random graph models for wireless communication networks [PDF]
, 2010 PhDThis thesis concerns mathematical models of wireless communication networks, in particular ad-hoc networks and 802:11 WLANs. In ad-hoc mode each of these devices may function as a sender, a relay or a receiver.
Song, Linlin
core +4 more sources
Covering polygonal annuli by strips [PDF]
, 2007 In 2000 Bezdek asked which plane convex bodies have the property that whenever an annulus, consisting of the body less a sufficiently small scaled copy of itself, is covered by strips, the sum of the widths of the strips must still be at least the ...
Laura Wisewell +3 more
core +2 more sources
On Pathos Semitotal and Total Block Graph of a Tree [PDF]
, 2011 The concept of pathos of a graph G was introduced by Harary [2], as a collection of minimum number of line disjoint open paths whose union is G. The path number of a graph G is the number of paths in pathos.
Muddebihal M. H.
core +1 more source
Labeling, Covering and Decomposing of Graphs — Smarandache’s Notion in Graph Theory [PDF]
, 2010 This paper surveys the applications of Smarandache’s notion to graph theory appeared in International J.Math.Combin. from Vol.1,2008 to Vol.3,2009.
Mao, Linfan, Linfan Mao
core +1 more source
Directed graph iterated function systems [PDF]
, 2011 This thesis concerns an active research area within fractal geometry. In the first part, in Chapters 2 and 3, for directed graph iterated function systems (IFSs) defined on ℝ, we prove that a class of 2-vertex directed graph IFSs have attractors that ...
Boore, Graeme C.
core +2 more sources
Mathematics, 2023 A fuzzy graph G is stated to have a set of trees as its tree cover if all the vertices of G are in their union. The maximum weight tree in the tree cover is assumed to be the cost of a tree cover for a fuzzy graph.
Anushree Bhattacharya, Madhumangal Pal
doaj +1 more source
Nordhaus-gaddum type inequalities for tree covering numbers on unitary cayley graphs of finite rings [PDF]
Transactions on Combinatorics, 2022 The unitary Cayley graph $\Gamma_n$ of a finite ring $\mathbb{Z}_n$ is the graph with vertex set $\mathbb{Z}_n$ and two vertices $x$ and $y$ are adjacent if and only if $x-y$ is a unit in $\mathbb{Z}_n$. A family $\mathcal{F}$ of mutually edge disjoint
Denpong Pongpipat, Nuttawoot Nupo
doaj +1 more source
On covers of graphs by Cayley graphs [PDF]
European Journal of Combinatorics, 2017 We prove that every vertex transitive, planar, 1-ended, graph covers every graph whose balls of radius r are isomorphic to the ball of radius r in G for a sufficiently large r. We ask whether this is a general property of finitely presented Cayley graphs, as well as further related questions.
openaire +4 more sources
On Pathos Total Semitotal and Entire Total Block Graph of a Tree [PDF]
, 2012 In this communication, the concept of pathos total semitotal and entire total block graph of a tree is introduced. Its study is concentrated only on trees.
Syed Babajan +2 more
core +1 more source