Results 31 to 40 of about 226,666 (311)
Novel Concept of Interval-Valued Neutrosophic Incidence Graphs with Application [PDF]
Neutrosophic Sets and Systems, 2021 : Neutrosophic set (NS) is a framework used when the imprecision and uncertainty of an event are described based on three possible aspects, i.e., the membership degree, neutral membership degree and non-membership degree.
Siti Nurul Fitriah Mohamad +4 more
doaj +1 more source
End Simplicial Vertices in Path Graphs
Discussiones Mathematicae Graph Theory, 2016 A graph is a path graph if there is a tree, called UV -model, whose vertices are the maximal cliques of the graph and for each vertex x of the graph the set of maximal cliques that contains it induces a path in the tree.
Gutierrez Marisa, Tondato Silvia B.
doaj +1 more source
On the Representation of a PI-Graph
Trends in Computational and Applied Mathematics, 2007 Consider two parallel lines (denoted r1 and r2). A graph is a PI graph (Point-Interval graph) if it is an intersection graph of a family F of triangles between r1 and r2 such that each triangle has an interval with two endpoints on r1 and a vertex (a ...
S.M. Almeida, C.P. de Mello, A. Gomide
doaj +1 more source
Interval-valued bipolar fuzzy line graphs
BMC Research Notes, 2023 Objectives The notion of Bipolarity based on positive and negative outcomes. It is well known that bipolar models give more precision, flexibility, and compatibility to the system as compared to the classical models and fuzzy models.
Keneni Abera Tola +2 more
doaj +1 more source
Discrete Applied Mathematics, 1998 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Fred R. McMorris +2 more
openaire +2 more sources
Betweenness in graphs: A short survey on shortest and induced path betweenness
AKCE International Journal of Graphs and Combinatorics, 2019 Betweenness is a universal notion present in several disciplines of mathematics. The notion of betweenness has a profound history and many pioneers like Euclid, Pasch, Hilbert have studied betweenness axiomatically.
Manoj Changat +2 more
doaj +2 more sources
Cliques and Clique Covers in Interval-Valued Fuzzy Graphs
International Journal of Computational Intelligence Systems, 2021 Finding cliques and clique covers in graphs are one of the most needful tasks. In this paper, interval-valued fuzzy cliques (IVFQs) and interval-valued fuzzy clique covers (IVFQCs) of an interval-valued fuzzy graph (IVFG) are introduced by introducing ...
Napur Patra +3 more
doaj +1 more source
The LexCycle on $\overline{P_{2}\cup P_{3}}$-free Cocomparability Graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2020 A graph $G$ is a cocomparability graph if there exists an acyclic transitive orientation of the edges of its complement graph $\overline{G}$. LBFS$^{+}$ is a variant of the generic Lexicographic Breadth First Search (LBFS), which uses a specific tie ...
Xiao-Lu Gao, Shou-Jun Xu
doaj +1 more source
Interval graphs and interval orders
Discrete Mathematics, 1985 This paper investigates the connection between interval graphs and interval orders, with special attention to the family of interval orders that agree with or provide representations of an interval graph. Relationships between interval graphs and interval orders that concern the number of lengths required for interval representations and bounds on ...
openaire +1 more source
Games on interval and permutation graph representations [PDF]
, 2016 We describe combinatorial games on graphs in which two players antagonistically build a representation of a subgraph of a given graph. We show that for a large class of these games, determining whether a given instance is a winning position for the next ...
Enright, Jessica, Stewart, Lorna
core +1 more source