Results 11 to 20 of about 5,865,138 (250)
Theoretical Computer Science, 2008 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Andreas Brandstädt, Van Bang Le
openaire +4 more sources
A Graph Rewriting Visual Language for Database Programming [PDF]
, 1997 Textual database programming languages are computationally complete, but have the disadvantage of giving the user a non-intuitive view of the database information that is being manipulated.
Rodgers, Peter +5 more
core +1 more source
On the Structure of the Power Graph and the Enhanced Power Graph of a Group
The Electronic Journal of Combinatorics, 2017 Let $G$ be a group. The power graph of $G$ is a graph with the vertex set $G$, having an edge between two elements whenever one is a power of the other. We characterize nilpotent groups whose power graphs have finite independence number. For a bounded exponent group, we prove its power graph is a perfect graph and we determine its clique ...
Ghodratollah Aalipour +4 more
openaire +4 more sources
, 2011 In this paper, we introduce ideal graph of a graph and study some of its properties. We characterize connectedness, isomorphism of graphs and coloring property of a graph using ideal graph.
Manoharan, R., Vasuki, R.
core +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
The power graph of a torsion-free group determines the directed power graph [PDF]
Discrete Applied Mathematics, 2021 The directed power graph $\vec{\mathcal G}(\mathbf G)$ of a group $\mathbf G$ is the simple digraph with vertex set $G$ such that $x\rightarrow y$ if $y$ is a power of $x$. The power graph of $\mathbf G$, denoted with $\mathcal G(\mathbf G)$, is the underlying simple graph. In this paper, for groups $\mathbf G$ and $\mathbf H$, the following is proved.
openaire +4 more sources
A comparison of classical scheduling approaches in power-constrained block-test scheduling [PDF]
, 2000 Classical scheduling approaches are applied here to overcome the problem of unequal-length block-test scheduling under power dissipation constraints. List scheduling-like approaches are proposed first as greedy algorithms to tackle the fore mentioned ...
Wang, Xiaojun +6 more
core +2 more sources
The Electronic Journal of Combinatorics, 2011 For a graph $G$, its $r$th power is constructed by placing an edge between two vertices if they are within distance $r$ of each other. In this note we study the amount of edges added to a graph by taking its $r$th power. In particular we obtain that, for $r\geq 3$, either the $r$th power is complete or "many" new edges are added.
openaire +6 more sources
A Random Graph Model for Power Law Graphs [PDF]
Experimental Mathematics, 2001 We propose a random graph model which is a special case of sparserandom graphs with given degree sequences which satisfy a power law. This model involves only a small number of paramo eters, called logsize and log-log growth rate. These parameters capture some universal characteristics of massive graphs. From these parameters, various properties of the
Aiello, William, Chung, Fan, Lu, Linyuan
openaire +2 more sources
Quotient graphs for power graphs [PDF]
Rendiconti del Seminario Matematico della Università di Padova, 2017 In a previous paper of the first author a procedure was developed for counting the components of a graph through the knowledge of the components of one of its quotient graphs. Here we apply that procedure to the proper power graph \mathcal{P}_0(G ...
BUBBOLONI, DANIELA +2 more
openaire +3 more sources