Results 41 to 50 of about 3,066,756 (267)
Quotient graphs for power graphs [PDF]
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) of a finite group
BUBBOLONI, DANIELA+2 more
openaire +4 more sources
A graph rewriting programming language for graph drawing [PDF]
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
A B\"uchi-Elgot-Trakhtenbrot theorem for automata with MSO graph storage
We introduce MSO graph storage types, and call a storage type MSO-expressible if it is isomorphic to some MSO graph storage type. An MSO graph storage type has MSO-definable sets of graphs as storage configurations and as storage transformations.
Engelfriet, Joost, Vogler, Heiko
core +1 more source
Equistable graphs, general partition graphs, triangle graphs, and graph products
AbstractIn this paper we examine the connections between equistable graphs, general partition graphs and triangle graphs. While every general partition graph is equistable and every equistable graph is a triangle graph, not every triangle graph is equistable, and a conjecture due to Jim Orlin states that every equistable graph is a general partition ...
Martin Milanič, Štefko Miklavič
openaire +2 more sources
Motivation The prediction of cancer drug response is a challenging subject in modern personalized cancer therapy due to the uncertainty of drug efficacy and the heterogeneity of patients.
Chuanqi Lao+5 more
doaj +1 more source
An Inclusive Distance Irregularity Strength of n-ary Tree
An inclusive distance vertex irregular labelling of a simple graph G is a function of the vertex set of to positive integer set such that the sum of its vertex label and the labels of all vertices adjacent to the vertex are distinct.
Kristiana Wijaya+3 more
doaj +1 more source
Let be a graph of order . A numbering of is a labeling that assigns distinct elements of the set to the vertices of , where each edge of is labeled .
Rikio Ichishima+2 more
doaj +1 more source
FoxO1 signaling in B cell malignancies and its therapeutic targeting
FoxO1 has context‐specific tumor suppressor or oncogenic character in myeloid and B cell malignancies. This includes tumor‐promoting properties such as stemness maintenance and DNA damage tolerance in acute leukemias, or regulation of cell proliferation and survival, or migration in mature B cell malignancies.
Krystof Hlavac+3 more
wiley +1 more source
Integration and measures on the space of countable labelled graphs [PDF]
In this paper we develop a rigorous foundation for the study of integration and measures on the space $\mathscr{G}(V)$ of all graphs defined on a countable labelled vertex set $V$.
Khare, Apoorva, Rajaratnam, Bala
core
On the strong beta-number of galaxies with three and four components
The beta-number of a graph is the smallest positive integer for which there exists an injective function such that each is labeled and the resulting set of edge labels is for some positive integer . The beta-number of is if there exists no such integer .
Rikio Ichishima+2 more
doaj +1 more source