Results 31 to 40 of about 174,868,130 (283)
Improved distributed degree splitting and edge coloring [PDF]
Distributed Computing, 2019 The degree splitting problem requires coloring the edges of a graph red or blue such that each node has almost the same number of edges in each color, up to a small additive discrepancy. The directed variant of the problem requires orienting the edges such that each node has almost the same number of incoming and outgoing edges, again up to a small ...
Mohsen Ghaffari 0001 +5 more
openaire +9 more sources
The Effect of Random Edge Removal on Network Degree Sequence.
, 2012 Many networks arise in a random and distributed fashion, and yet result in having a specific type of degree structure: e.g., the WWW, many social networks, biological networks, etc., exhibit power-law, stretched exponential, or similar degree structures.
Srinivasan, Aravind +3 more
core +9 more sources
The maximum number of edges in a graph with fixed edge-degree
Discrete Mathematics, 1998 For \(t\geq 17\) and \(n\geq 2t+2\), let \(G\) be a graph with \(n\) vertices whose complement is connected, and such that for all non-adjacent vertices \(u,v\), there are at least \(t\) common neighbours. It is proved that \(| E(G)|\geq \lceil((2t+1)n- 2t^2- 3)/2\rceil\) for \(n\leq 3t-1\), and \(| E(G)|\geq (t+1)n- t^2- t-3\) for \(n\geq 3t ...
Ralph J. Faudree, J. Sheehan
openaire +2 more sources
Privacy Protection Method for k Degree Anonymity Based on Node Classification [PDF]
Jisuanji gongcheng, 2020 Existing k degree anonymous privacy protection methods usually damage the graph structure significantly and cannot resist structural background knowledge attacks.To address the problem,this paper proposes an improved k degree anonymous privacy protection
JIN Ye, DING Xiaobo, GONG Guoqiang, Lü Ke
doaj +1 more source
Using a Bayesian approach to reconstruct graph statistics after edge sampling
Applied Network Science, 2023 Often, due to prohibitively large size or to limits to data collecting APIs, it is not possible to work with a complete network dataset and sampling is required.
Naomi A. Arnold +2 more
doaj +1 more source
Edge Bundling Method Based on Homologous Control Points [PDF]
Jisuanji kexue, 2022 Edge bundling is an effective method to reduce the visual clutter caused by the visualization of the node-link diagram with a large number of complex connections.Generally,the edge bundling based on spatial proximity will lead to independent edge ...
LIU Meng-xin, ZHANG Fan, LI Tian-rui
doaj +1 more source
The average degree of edge chromatic critical graphs with maximum degree seven
Journal of Graph Theory, 2023 AbstractIn this paper, by developing several new adjacency lemmas about a path on four or five vertices, we show that the average degree of 7‐critical graphs is at least 6. It implies Vizing's planar graph conjecture for planar graphs with maximum degree 7 and its extension to graphs embeddable in a surface with nonnegative Euler characteristic due to ...
Yan Cao 0001 +3 more
openaire +3 more sources
Computation of Vertex-Edge Degree Based Topological Descriptors for Hex-Derived Networks
IEEE Access, 2021 A numeric number that represents the entire structure of a graph is defined to be a topological descriptor. Graph theory has been found to be a useful area of research in the direction of topological descriptors.
Ali N. A. Koam +2 more
doaj +1 more source
Number of edges in degree-magic graphs
Discrete Mathematics, 2013 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
L'udmila Bezegová, Jaroslav Ivanco
openaire +1 more source
Edge coloring graphs with large minimum degree
Journal of Graph Theory, 2022 AbstractLet be a simple graph with maximum degree . A subgraph of is overfull if Chetwynd and Hilton in 1986 conjectured that a graph with has chromatic index if and only if contains no overfull subgraph. The best previous results supporting this conjecture have been obtained for regular graphs.
Michael J. Plantholt, Songling Shan
openaire +2 more sources