在无环有向图中,我们把 |∂+(X)| 和|∂−(X)| 称为X的出度(outdegree)和入度(indegree),记为 d+(X) 和d−(X) 。有向图被称为强连通的(strongly connected)或者强的(strong),若对于V的任意非空真子集X,都有 ∂+(X)≠∅ (同理对于V的任意非空真子集X,都有 ∂−(X)≠∅)...
VERTEX-EDGE AND EDGE-VERTEX PARAMETERS IN GRAPHS 来自 ResearchGate 喜欢 0 阅读量: 67 作者: JR Lewis 摘要: The majority of graph theory research on parameters involved with domination, independence, and irredundance has focused on either sets of vertices or sets of edges; for example, sets ...
Recognizing edge intersection graphs of linear 3-uniform hypergraphs in the class of \\{Butterfly, Gem\\}-free graphsWe consider a binary operation on ... P Skums,R Tyshkevich 被引量: 0发表: 2005年 Algorithmic aspects of intersection graphs and representation hypergraphs graph theory/ intersec...
- 《Journal of Combinatorial Theory》 被引量: 355发表: 1988年 Broadcasting in random graphs We are interested in the minimum time needed to broadcast a message from one vertex to all the vertices of G n,p random graphs. We are also interested in ... AV Gerbessiotis - 《Discrete Applied...
An edge-distinguishing index of a graph G is the minimum number of colours in a proper colouring which distinguishes every two distinct edges of G. We determine the edge-distinguishing index for cycles, paths and complete graphs. 展开
In this paper we give simple degree sequence conditions for the equality of edge-connectivity and minimum degree of a (di-)graph. One of the conditions imp... P Dankelmann,L Volkmann - 《Journal of Graph Theory》 被引量: 135发表: 1997年 On conditional edge-connectivity of graphs Letk ...
We are interested in finding the conditions under which a given r‐regular coloring of ( X h ) is extendible to an s‐regular coloring of ( Y h ... A Bahmanian,S Haghshenas - 《Journal of Graph Theory》 被引量: 0发表: 2020年 加载更多研究...
For basic terminology in graph theory, we refer to [2]. In 1950s, Claude Shannon invented the following game, as a simple model for breakdown repair of the connectivity of a network [7, pp. 86–87]: Shannon switching game. There are two players; Short and Cut. For a given connected...
A facial-parity edge-coloring of a 2-edge-connected plane graph is a facially-proper edge-coloring in which every face is incident with zero or an odd numb... K Torgel - 《Discussiones Mathematicae Graph Theory》 被引量: 0发表: 2023年 加载更多研究...
摘要: We show that every vertex-transitive, edge-transitive graph of odd valence and subexponential growth is -transitive, thus extending to infinite graphs a theorem of W. T. Tutte for finite graphs. We describe a number of counterexamples in the case of exponential growth....