Again we need some basic graph theory. Let us, for a while, admit nonsimple graphs as well, that is, graphs that can have loops and parallel edges. Such a graph G is connected if there is a path bet…
Finally, we compute the connected domination value and number of γc-sets for a few well-known family of graphs.doi:10.5614/ejgta.2021.9.1.11Das, AngsumanElectronic Journal of Graph Theory & Applications
Now, one can use graphs to model a wide range of different phenomena both in mathematics and the real world. Here are just a few examples of how graph theory can be used: Graph theory can be used to model communities in the network, such as social media or contact tracing for illnesses...
GraphsearchingwasintroducedbyParson[TParson,Pursuit-evasioninagraph,in:TheoryandApplicationsofGraphs,in:LectureNotesinMathematics,Springer-Verlag(1976)pp‘’’ 426–441]:givena‘‘contaminated’’graphG(eg,anetworkcontainingahostileintruder),thesearchnumbers(G)ofthegraphGistheminimumnumberofsearchersneededto‘...
In the mathematical theory of directed graphs, a graph is said to be strongly connected or diconnected if every vertex is reachable from every other vertex. 有向图强连通分量的Tarjan算法 (“郭家寶”,个人网站byvoid.com 的页面 强烈推荐大神的博客) ...
Graph Theory, submitted for publication - Hellwig, VolkmannSufficient conditions for graphs to be λ‘-optimal, super-edge-connected and maximally edge-... A Hellwig,L Volkmann - 《Journal of Graph Theory》 被引量: 290发表: 2005年 Sufficient conditions for maximally connected dense graphs This...
A graph is upward planar if it can be drawn without edge crossings such that all edges point upward. Upward planar graphs have been studied on the plane, the standing and rolling cylinders. For all these surfaces, the respective decision problem \(\mathcal{NP}\)-hard in general. Efficient...
Directed distance in digraphs: centers and medians J. Graph Theory, 17 (1993), pp. 509-521 CrossrefView in ScopusGoogle Scholar [4] G.R.T. Hendry On graphs with prescribed median I J. Graph Theory, 9 (1985), pp. 477-481 CrossrefView in ScopusGoogle Scholar [5] K.S. Holbert A...
摘要: In this paper we investigate ecological flow networks via graph theory in search of the real sequential chains through which energy passes from producers to consumers in complex fo... 查看全部>>关键词: FOOD-WEB STRUCTURE TROPHIC INTERACTIONS ECOSYSTEMS COMPARTMENTS NETWORK 年份: 2005 ...
Independence Stability Connected graph 1. Introduction We consider finite, simple, and undirected graphs G with vertex set VG and edge set EG. For a graph G, we denote its order by n(G) and its size by m(G), respectively. The neighbourhood of a vertex u∈VG in a graph G is denoted...