Results 21 to 30 of about 313,328 (262)
Acyclic edge coloring of graphs with maximum degree 4 [PDF]
Journal of Graph Theory, 2009 AbstractAn acyclic edge coloring of a graph is a proper edge coloring such that there are no bichromatic cycles. The acyclic chromatic index of a graph is the minimum number k such that there is an acyclic edge coloring using k colors and is denoted by a′(G). It was conjectured by Alon, Sudakov, and Zaks that for any simple and finite graph G, a′(G)⩽Δ +
Basavaraju, Manu, Chandran, Sunil L
openaire +2 more sources
Structural controllability of general edge dynamics in complex network
Scientific Reports, 2023 Dynamic processes that occur on the edge of complex networks are relevant to a variety of real-world systems, where states are defined on individual edges, and nodes are active components with information processing capabilities.
Shaopeng Pang +3 more
doaj +1 more source
Edge-colouring of regular graphs of large degree
Theoretical Computer Science, 2007 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
De Simone C, Galluccio A
openaire +4 more sources
Properly Edge-Coloured Subgraphs in Colourings of Bounded Degree [PDF]
Graphs and Combinatorics, 2010 The smallest \(n\) such that every coloring of the edges of the \(n\)-vertex complete graph \(K_n\) must contain a monochromatic star \(K_{1,s+1}\) or a properly edge-colored \(K_t\) is denoted by \(f(s,t)\), Its existence is guaranteed by the Erdős-Rado Canonical Ramsey theorem.
Markström, Klas +2 more
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
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
Some Vertex/Edge-Degree-Based Topological Indices of r-Apex Trees
Journal of Mathematics, 2021 In chemical graph theory, graph invariants are usually referred to as topological indices. For a graph G, its vertex-degree-based topological indices of the form BIDG=∑uv∈EGβdu,dv are known as bond incident degree indices, where EG is the edge set of G ...
Akbar Ali +6 more
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
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
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 +3 more
openaire +2 more sources