Results 31 to 40 of about 2,650,610 (297)
An algorithm to recognize a middle graph
Discrete Applied Mathematics, 1984 AbstractA graph F is called middle if there exists a graph G such that there is a one-to-one correspondence between the vertices of F and the vertices and edges of G such that two vertices of F are adjacent if and only if the corresponding elements (considered as subsets of the set of vertices) have a non-empty intersection.In this paper we present a ...
Miroslawa Skowronska, Maciej M. Syslo
openaire +2 more sources
On Domatic Number of Some Rotationally Symmetric Graphs
Journal of Mathematics, 2023 Domination is a well-known graph theoretic concept due to its significant real-world applications in several domains, such as design and communication network analysis, coding theory, and optimization.
Hassan Raza +2 more
doaj +1 more source
A Heuristic for Direct Product Graph Decomposition [PDF]
, 2023 In this paper we describe a heuristic for decomposing a directed graph into factors according to the direct product (also known as Kronecker, cardinal or tensor product). Given a directed, unweighted graph G with adjacency matrix Adj(G), our heuristic
Moreno Marzolla +2 more
core +1 more source
Hamiltonicity of complements of middle graphs
Discrete Mathematics, 2007 Let \(G(V,E)\) be an undirected finite simple graph. The middle graph \(M(G)\) of \(G\) has the vertex set \(V(G)\cup E(G)\) and two vertices \(x,y\) of \(M(G)\) are adjacent in \(M(G)\) if at least one of them corresponds to an edge \(e\) of \(G\) and the other one is either one of the endvertices of \(e\) in \(G\), or corresponds to an edge \(f\) of \
Xinhui An, Baoyindureng Wu
openaire +2 more sources
On the bondage number of middle graphs
Mathematical Notes, 2013 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Aytac, A., Turaci, T., Odabas, Z. N.
openaire +4 more sources
Frontiers in Aging Neuroscience, 2020 Mild cognitive impairment (MCI) is often considered a critical time window for predicting early conversion to Alzheimer’s disease (AD). Brain functional connectome data (i.e., functional connections, global and nodal graph metrics) based on resting-state
Xiaowen Xu +13 more
doaj +1 more source
Bioengineering, 2023 Neuropathic pain (NP) following spinal cord injury (SCI) is refractory to pain control strategies, and the underlying neuronal mechanisms remain poorly understood.
Eunhee Park +6 more
doaj +1 more source
A numeral system for the middle-levels graphs [PDF]
Electronic Journal of Graph Theory and Applications, 2021 The middle-levels graph $M_k ...
openaire +5 more sources
Graph Algorithm Animation with Grrr [PDF]
, 2000 We discuss geometric positioning, highlighting of visited nodes and user defined highlighting that form the algorithm animation facilities in the Grrr graph rewriting programming language. The main purpose of animation was initially for the debugging and
Peter J. Rodgers +3 more
core +1 more source
Vertex semi-middle graph of a graph
Malaya Journal of Matematik, 2019 In this communication, the vertex semi-middle graph of a graph $M_v(G)$ is introduced. We obtain a characterization of graphs whose $M_v(G)$ is planar, outerplanar and minimally non-outerplanar. Further, we obtain $M_v(G)$ is Eulerian, crossing number one and crossing number two.
null Rajendra Prasad K C +2 more
openaire +1 more source