Reflexive Edge Strength on Slanting Ladder Graph and Corona of Centipede and Null Graph
Indonesian Journal of CombinatoricsAssume <em>G</em> is a graph that is simple, undirected, and connected. If every edge label is a positive integer in the range 1 to <em>k</em><sub>e</sub>, and every vertex label is a non-negative even number from 0 to 2<em>k</em><sub>v</sub>, then a graph <em>G</em> is considered ...
Mochamad Raffli Ispriyanto +2 more
semanticscholar +4 more sources
Edge Irregular Reflexive Labeling of Ladder Graph Corona Null Graph Families
European Journal of Pure and Applied MathematicsGiven a graph $G(V,E)$ or simply written as $G$. The graph labeling was first introduced in 1960, it is a function that mapping integers or labels to graph elements (vertices, edges, or both of them) which must satisfy some certain criteria. This concepts was applied in some real problems.
Diari Indriati +6 more
semanticscholar +4 more sources
On local antimagic chromatic numbers of circulant graphs join with null graphs or cycles
Proyecciones (Antofagasta), 2023 An edge labeling of a graph G = (V,E) is said to be local antimagic if there is a bijection f : E → {1,..., |E|} such that for any pair of adjacent vertices x and y, f +(x) ≠ f +(y), where the induced vertex label is f +(x) = ? f(e), with e ranging over all the edges incident to x.
Gee-Choon Lau +3 more
semanticscholar +5 more sources
On Null Vertex in Bipolar Fuzzy Graphs
International Journal of Analysis and ApplicationsWe present a novel vertex in Bipolar fuzzy graph, null vertex, which is distinct from boundary vertex and interior vertex and also attempt a study on null vertex in bipolar fuzzy closed helm graph CHn.
Meenu Sunil, J. Suresh Kumar
semanticscholar +4 more sources
A universal null graph whose domain has positive measure [PDF]
Colloquium Mathematicum, 1982 Gregory Cox
semanticscholar +3 more sources
Joint Formation Control with Obstacle Avoidance of Towfish and Multiple Autonomous Underwater Vehicles Based on Graph Theory and the Null-Space-Based Method [PDF]
Sensors, 2019 In this study, a new joint formation combined with a two-part underwater towed vehicle (towfish) with multiple autonomous underwater vehicles (AUVs) was investigated.
Shi-kun Pang, Ying-hui Li, Hong Yi
doaj +3 more sources
Lucky \(k\)-polynomials of null and complete split graphs
Open Journal of Discrete Applied Mathematics, 2022 The concept of Lucky colorings of a graph is used to introduce the notion of the Lucky \(k\)-polynomials of null graphs. We then give the Lucky \(k\)-polynomials for complete split graphs and generalized star graphs. Finally, further problems of research related to this concept are discussed.
Johan Kok
semanticscholar +3 more sources
Tailored graph ensembles as proxies or null models for real networks II: results on directed graphs [PDF]
Journal of Physics A: Mathematical and Theoretical, 2011 We generate new mathematical tools with which to quantify the macroscopic topological structure of large directed networks. This is achieved via a statistical mechanical analysis of constrained maximum entropy ensembles of directed random graphs with prescribed joint distributions for in- and outdegrees and prescribed degree-degree correlation ...
E S Roberts, T Schlitt, A C C Coolen
semanticscholar +6 more sources
On the null spaces of quartic circulant graphs
Discrete Mathematical Chemistry, 2022 A circulant graph is a simple graph whose adjacency matrix can be represented in the form of a circulant matrix, while a nut graph is considered to be a graph whose null space is spanned by a single full vector.
Ivan Damnjanović
semanticscholar +4 more sources
Subgraph Covers: An Information-Theoretic Approach to Motif Analysis in Networks [PDF]
Physical Review X, 2014 Many real-world networks contain a statistically surprising number of certain subgraphs, called network motifs. In the prevalent approach to motif analysis, network motifs are detected by comparing subgraph frequencies in the original network with a ...
Anatol E. Wegner
doaj +5 more sources