Results 61 to 70 of about 2,536,304 (342)
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
On (a,d)-antimagic labelings of Hn, FLn and mCn
Indonesian Journal of Combinatorics, 2020 In this paper, we derive the necessary condition for an (a,d )- antimagic labeling of some new classes of graphs such as Hn, F Ln and mCn. We prove that Hn is (7n +2, 1)-antimagic and mCn is ((mn+3)/2,1)- antimagic.
Ramalakshmi Rajendran, K. M. Kathiresan
doaj +1 more source
Packing Smaller Graphs into a Graph
Discrete Mathematics, 1989 Let G be a connected graph and \(\alpha_ m(G)\) denote the largest number of vertex-disjoint connected subgraphs \(H_ 1,H_ 2,...,H_ k\) of G each having m vertices. The authors obtain the following bounds for the m-packing number \(\alpha_ m(G)\) for a connected graph G of order n and maximum degree \(\Delta\). \[ \lceil \frac{n-m+1}{(m-1)(\Delta -1)+1}
Jin Akiyama +2 more
openaire +3 more sources
Biclique Graphs of K3-free Graphs and Bipartite Graphs
Procedia Computer Science, 2021 A biclique of a graph is a maximal complete bipartite subgraph. The biclique graph of a graph $G$, $KB(G)$, defined as the intersection graph of the bicliques of $G$, was introduced and characterized in 2010. However, this characterization does not lead to polynomial time recognition algorithms.
Marina Groshaus +1 more
openaire +4 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
On Rainbow Antimagic Coloring of Joint Product of Graphs
Cauchy: Jurnal Matematika Murni dan Aplikasi, 2023 Let be a connected graph with vertex set and edge set . A bijection from to the set is a labeling of graph . The bijection is called rainbow antimagic vertex labeling if for any two edge and in path , where and .
Brian Juned Septory +3 more
doaj +1 more source
Annals of Pure and Applied Logic, 2017 In two previous papers, we exposed a combinatorial approach to the program of Geometry of Interaction, a program initiated by Jean-Yves Girard. The strength of our approach lies in the fact that we interpret proofs by simpler structures - graphs - than Girard's constructions, while generalizing the latter since they can be recovered as special cases of
openaire +6 more sources
Learning Entity and Relation Embeddings for Knowledge Graph Completion
AAAI Conference on Artificial Intelligence, 2015 Knowledge graph completion aims to perform link prediction between entities. In this paper, we consider the approach of knowledge graph embeddings.
Yankai Lin +4 more
semanticscholar +1 more source
Genus Distribution for a Graph [PDF]
, 2009 In this paper we develop the technique of a distribution decomposition for a graph. A formula is given to determine genus distribution of a cubic graph.
Liangxia, Wan +2 more
core +1 more source
Tulgeity of Line, Middle and Total Graph of Wheel Graph Families [PDF]
, 2010 Tulgeity r(G) is the maximum number of disjoint, point induced, non acyclic subgraphs contained in G. In this paper one finds the tulgeity of line, middle and total graph of wheel graph, Gear graph and Helm ...
Vernold, Vivin +2 more
core +1 more source