Results 21 to 30 of about 5,537,312 (288)
Graph Powers and Graph Homomorphisms [PDF]
The Electronic Journal of Combinatorics, 2010 In this paper, we investigate some basic properties of fractional powers. In this regard, we show that for any non-bipartite graph $G$ and positive rational numbers ${2r+1\over 2s+1} < {2p+1\over 2q+1}$, we have $G^{2r+1\over 2s+1} < G^{2p+1\over 2q+1}$. Next, we study the power thickness of $G$, that is, the supremum of rational numbers ${2r+
Hossein Hajiabolhassan, Ali Taherkhani
openaire +3 more sources
THE POWER GRAPH REPRESENTATION FOR INTEGER MODULO GROUP WITH POWER PRIME ORDER
Barekeng, 2023 There are many applications of graphs in various fields. Starting from chemical problems, such as the molecular shape of a compound to internet network problems, we can also use graphs to depict the abstract concept of a mathematical structure..
Lalu Riski Wirendra Putra +4 more
doaj +1 more source
Permutational Powers of a Graph [PDF]
The Electronic Journal of Combinatorics, 2019 This paper introduces a new graph construction, the permutational power of a graph, whose adjacency matrix is obtained by the composition of a permutation matrix with the adjacency matrix of the graph. It is shown that this construction recovers the classical zig-zag product of graphs when the permutation is an involution, and it is in fact more ...
Matteo Cavaleri +2 more
openaire +3 more sources
A graph rewriting programming language for graph drawing [PDF]
, 1998 This paper describes Grrr, a prototype visual graph drawing tool. Previously there were no visual languages for programming graph drawing algorithms despite the inherently visual nature of the process.
Rodgers, Peter
core +1 more source
The H-Line Signed Graph of a Signed Graph [PDF]
, 2010 For standard terminology and notion in graph theory we refer the reader to Harary; the non-standard will be given in this paper as and when required.
Reddy, Siva Kota +2 more
core +1 more source
Compact routing on the Internet AS-graph [PDF]
, 2011 Compact routing algorithms have been presented as candidates for scalable routing in the future Internet, achieving near-shortest path routing with considerably less forwarding state than the Border Gateway Protocol.
Stephen D. Strowes +5 more
core +1 more source
Classifying Higher Rank Toeplitz Operators. [PDF]
, 2007 To a higher rank directed graph (Λ, d), in the sense of Kumjian and Pask, 2000, one can associate natural noncommutative analytic Toeplitz algebras, both weakly closed and norm closed.
Power, S.C.
core +4 more sources
Construction Technology of Knowledge Graph and its Application in Power Grid [PDF]
E3S Web of Conferences, 2021 With the rapid development of energy internet, dispatchers need to learn more knowledge with wider scope and fast update speed. It’s urgent to realize the knowledge electrification, knowledge systematization, knowledge visualization and knowledge sharing
Xiaoping Gai +5 more
doaj +1 more source
Graphs and Combinatorics, 2017 The {\em power index} $Θ(Γ)$ of a graph $Γ$ is the least order of a group $G$ such that $Γ$ can embed into the power graph of $G$. Furthermore, this group $G$ is {\em $Γ$-optimal} if $G$ has order $Θ(Γ)$. We say that $Γ$ is {\em power-critical} if its order equals to $Θ(Γ)$. This paper focuses on the power indices of complete graphs, complete bipartite
Xuanlong Ma, Min Feng 0004, Kaishun Wang
openaire +4 more sources
Connectivity of 2-distance graphs [PDF]
Journal of Mahani Mathematical ResearchFor a simple graph $G$, the $2$-distance graph, $D_2(G)$, is a graph with the vertex set $V(G)$ and two vertices are adjacent if their distance is $2$ in the graph $G$. In this paper, we characterize all graphs with connected $2$-distance graphs.
Sayyed Heidar Jafari, Seyed Reza Musawi
doaj +1 more source