Results 21 to 30 of about 2,145,411 (284)
On r-Edge Regular Neutrosophic Graphs [PDF]
Neutrosophic Sets and Systems, 2023 We approach learning characteristic on a neutrosophic graph such as r-edge regular neutrosophic graph, strongly edge regular neutrosophic graph and absolute degree of vertex since a neutrosophic set ππ = {β©π₯, πππ(π₯), πππ© (π₯), πππ(π₯)βͺ; π₯ β π} of a ...
M. Kaviyarasu
doaj +1 more source
On edge-graceful labeling and deficiency for regular graphs
AKCE International Journal of Graphs and Combinatorics, 2018 An edge-graceful labeling of a finite simple graph with p vertices and q edges is a bijection from the set of edges to the set of integers { 1 , 2 , β¦ , q } such that the vertex sums are pairwise distinct modulo p , where the vertex sum at a vertex is ...
Tao-Ming Wang, Guang-Hui Zhang
doaj +2 more sources
Degree associated edge reconstruction number of split graphs with biregular independent set is one
AKCE International Journal of Graphs and Combinatorics, 2020 A degree associated edge card of a graph G is an edge deleted subgraph of G with which the degree of the deleted edge is given. The degree associated edge reconstruction number of a graph G (or dern(G)) is the size of the smallest collection of the ...
N. Kalai Mathi, S. Monikandan
doaj +1 more source
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