Results 1 to 10 of about 1,519,388 (324)
EDGE IRREGULAR REFLEXIVE LABELING OF DUMBBELL GRAPH, CORONA OF OPEN LADDER, AND NULL GRAPH
BarekengGraph is a simple, connected, undirected graph with vertex set and edge set . A graph is called to have an edge irregular reflexive -labeling if its vertices can be labeled with even numbers from until and its edges can be labeled with ...
Thetania Miftakul Zalsa +2 more
doaj +5 more sources
The split-and-drift random graph, a null model for speciation [PDF]
Stochastic Processes and their Applications, 2018 We introduce a new random graph model motivated by biological questions relating to speciation. This random graph is defined as the stationary distribution of a Markov chain on the space of graphs on $\{1, \ldots, n\}$.
François Bienvenu +2 more
core +8 more sources
Gallai-Edmonds decomposition of unicyclic graphs from null space [PDF]
The American Journal of Combinatorics, 2022 In this paper, we compute the Gallai-Edmonds decomposition of a unicyclic graph $G$ using linear algebraic tools. More precisely, the Gallai-Edmonds decomposition of $G$ is obtained from the null space associated with adjacency matrices of its subtrees.
Luiz Emilio Allem +3 more
doaj +6 more sources
Null Model-Based Data Augmentation for Graph Classification [PDF]
IEEE Transactions on Network Science and Engineering, 2021 In network science, the null model is typically used to generate a series of graphs based on randomization as a term of comparison to verify whether a network in question displays some non-trivial features such as community structure. Since such non-trivial features play a significant role in graph classification, the null model could be useful for ...
Qi Xuan +5 more
semanticscholar +5 more sources
Edge irregular reflexive labeling on sun graph and corona of cycle and null graph with two vertices
Indonesian Journal of Combinatorics, 2021 Let G(V,E) be a simple and connected graph which set of vertices is V and set of edges is E. Irregular reflexive k-labeling f on G(V,E) is assignment that carries the numbers of integer to elements of graph, such that the positive integer {1,2, 3,...,ke}
Irfan Setiawan, Diari Indriati
doaj +4 more sources
Zero-sum magic graphs and their null sets
, 2020 For any element h of the Natural numbers, a graph G=(V,E), with vertex set V and edge set E, is said to be h-magic if there exists a labeling of the edge set E, using the integer group mod h such that the induced vertex labeling, the sum of all edges ...
Samuel M. Hansen
core +4 more sources
Null Spaces Dimension of the Eigenvalue -1 in a Graph
Science Journal of University of Zakho, 2019 In geographic, the eigenvalues and eigenvectors of transportation network provides many informations about its connectedness. It is proven that the more highly connected in a transportation network G has largest eigenvalue and hence more multiple ...
Gohdar H. Mohiaddin, Khidir R. Sharaf
doaj +4 more sources
Independence and matching numbers of unicyclic graphs from null space [PDF]
Computational and Applied Mathematics, 2020 We characterize unicyclic graphs that are singular using the support of the null space of their pendant trees. From this, we obtain closed formulas for the independence and matching numbers of a unicyclic graph, based on the support of its subtrees. These formulas allows one to compute independence and matching numbers of unicyclic graphs using linear ...
Luiz Emílio Allem +4 more
openalex +6 more sources
Null decomposition of unicyclic graphs [PDF]
Discrete Applied Mathematics, 2020 arXiv admin note: text overlap with arXiv:1907 ...
Luiz Emílio Allem +4 more
openalex +4 more sources
Indices, Graphs and Null Models: Analyzing Bipartite Ecological Networks [PDF]
The Open Ecology Journal, 2009 Many analyses of ecological networks in recent years have introduced new indices to describe network properties. As a consequence, tens of indices are available to address similar questions, differing in specific detail, sensitivity in detecting the property in question, and robustness with respect to network size and sampling intensity.
Carsten F. Dormann +3 more
openalex +4 more sources