Results 11 to 20 of about 166,587,123 (294)

Errata: New measures of graph irregularity

Electronic Journal of Graph Theory and Applications, 2015
This paper gives an errata to the paper "New measure of graph irregularity", Electronic Journal of Graph Theory and Applications {\bf 2}(1) (2014), 52-65.
Clive Elphick, Pawel Wocjan
doaj   +2 more sources

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, Luca Calderoni, Luciano Margara   +2 more
core   +1 more source

Order Reconfiguration under Width Constraints [PDF]

, 2023
In this work, we consider the following order reconfiguration problem: Given a graph G together with linear orders ω and ω′ of the vertices of G, can one transform ω into ω′ by a sequence of swaps of adjacent elements in such a way that, at each time ...
Petra Wolf, De Oliveira Oliveira, Mateus, Wolf, Petra Henrike Karola, Henning Fernau, De Oliveira, Mateus,, Wolf, Petra, Emmanuel Arrighi, Arrighi, Emmanuel Jean Paul Pierre, Fernau, Henning, Mateus de Oliveira Oliveira, Arrighi, Emmanuel   +10 more
core   +1 more source

Random graph models for wireless communication networks [PDF]

, 2010
PhDThis thesis concerns mathematical models of wireless communication networks, in particular ad-hoc networks and 802:11 WLANs. In ad-hoc mode each of these devices may function as a sender, a relay or a receiver.
Song, Linlin
core   +4 more sources

Graph products of groups [PDF]

, 1990
In the 1970's Baudisch introduced the idea of the semifree group, that is, a group in which the only relators are commutators of generators. Baudisch was mainly concerned with subgroup problems, employing length arguments on the elements of these groups.
Green, E.R, Green, Elisabeth Ruth
core   +7 more sources

On Total H-Irregularity Strength of the Disjoint Union of Graphs

Discussiones Mathematicae Graph Theory, 2020
A simple graph G admits an H-covering if every edge in E(G) belongs to at least to one subgraph of G isomorphic to a given graph H. For the subgraph H ⊆ G under a total k-labeling we define the associated H-weight as the sum of labels of all vertices and
Ashraf Faraha, López Susana Clara, Muntaner-Batle Francesc Antoni, Oshima Akito, Bača Martin, Semaničová-Feňovčíková Andrea   +5 more
doaj   +1 more source

Working with Lowell

AKCE International Journal of Graphs and Combinatorics, 2020
I have known Lowell Beineke for almost fifty years. Our first joint paper, on edge-colorings of graphs, was initiated in 1971, and since then we have produced further articles and nine books on graph theory, with another two books currently in progress ...
Robin Wilson
doaj   +1 more source

Some Topological Concepts Via Graph Theory

Tikrit Journal of Pure Science, 2020
Due it is difficult to find applications in topological spaces, which are branches of pure mathematics, the importance of this paper is to find applications in graph theory.
Taha H. Jasim, Aiad I. Awad
doaj   +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, Subramanya, M.S., Rangarajan, R.   +2 more
core   +1 more source

Some Theoretical and Practical Results for Edge Dominating Set [PDF]

Engineering and Technology Journal, 2014
One of the most brilliant branches of modern mathematics and computer applications is graph theory. Graph domination problem has become an extremely important research branch of graph theory in recent times.
Nuha A. Rajab
doaj   +1 more source