Results 61 to 70 of about 1,939,159 (235)
Drawing Planar Graphs with Few Geometric Primitives [PDF]
, 2017 We define the \emph{visual complexity} of a plane graph drawing to be the number of basic geometric objects needed to represent all its edges. In particular, one object may represent multiple edges (e.g., one needs only one line segment to draw a path ...
A Igamberdiev +13 more
core +4 more sources
On hamiltonian line-graphs [PDF]
Transactions of the American Mathematical Society, 1968 Introduction. The line-graph L(G) of a nonempty graph G is the graph whose point set can be put in one-to-one correspondence with the line set of G in such a way that two points of L(G) are adjacent if and only if the corresponding lines of G are adjacent.
openaire +1 more source
A note on co-maximal graphs of commutative rings
AKCE International Journal of Graphs and Combinatorics, 2018 Let R be a commutative ring with unity. The co-maximal graph Γ ( R ) is the graph with vertex set R and two vertices a and b are adjacent if R a + R b = R .
Deepa Sinha, Anita Kumari Rao
doaj +1 more source
Brill-Noether theory of squarefree modules supported on a graph [PDF]
, 2012 We investigate the analogy between squarefree Cohen-Macaulay modules supported on a graph and line bundles on a curve. We prove a Riemann-Roch theorem, we study the Jacobian and gonality of a graph, and we prove Clifford's theorem.Comment: Major revision,
Baclawski +12 more
core +2 more sources
Reverse Line Graph Construction: The Matrix Relabeling Algorithm MARINLINGA Versus Roussopoulos's Algorithm [PDF]
, 2010 We propose a new algorithm MARINLINGA for reverse line graph computation, i.e., constructing the original graph from a given line graph. Based on the completely new and simpler principle of link relabeling and endnode recognition, MARINLINGA does not ...
Liu, D. +2 more
core
Solutions of Detour Distance Graph Equations
Sensors, 2022 Graph theory is a useful mathematical structure used to model pairwise relations between sensor nodes in wireless sensor networks. Graph equations are nothing but equations in which the unknown factors are graphs.
S. Celine Prabha +7 more
doaj +1 more source
Relations between the distinguishing number and some other graph parameters [PDF]
ریاضی و جامعهA distinguishing coloring of a simple graph $G$ is a vertex coloring of $G$ which is preserved only by the identity automorphism of $G$. In other words, this coloring ``breaks'' all symmetries of $G$.
Bahman Ahmadi +1 more
doaj +1 more source
Under which conditions is λ″(G)=κ″(L(G))?
AKCE International Journal of Graphs and Combinatorics, 2023 In this paper we show that if G is a connected graph such that [Formula: see text], [Formula: see text] and [Formula: see text] then [Formula: see text] exists and [Formula: see text] if and only if G is not super-[Formula: see text]. We also obtain some
Farnaz Soliemany +2 more
doaj +1 more source
Maintenance of Strongly Connected Component in Shared-memory Graph
, 2018 In this paper, we present an on-line fully dynamic algorithm for maintaining strongly connected component of a directed graph in a shared memory architecture. The edges and vertices are added or deleted concurrently by fixed number of threads.
C Demetrescu +4 more
core +1 more source
Color-line and proper color-line graphs
Discrete Applied Mathematics, 2020 Motivated by investigations of rainbow matchings in edge colored graphs, we introduce the notion of color-line graphs that generalizes the classical concept of line graphs in a natural way. Let $H$ be a (properly) edge-colored graph. The (proper) color-line graph $C\!L(H)$ of $H$ has edges of $H$ as vertices, and two edges of $H$ are adjacent in $C\!L ...
Le, Van Bang, Pfender, Florian
openaire +4 more sources