-
161
On An Extremal Problem In The Class Of Bipartite 1-Planar Graphs
Published 2016-02-01Subjects: Get full text
Article -
162
The Complexity of Secure Domination Problem in Graphs
Published 2018-05-01Subjects: Get full text
Article -
163
Completely independent spanning trees in some Cartesian product graphs
Published 2023-05-01Subjects: Get full text
Article -
164
Unbalanced signed graphs with eigenvalue properties
Published 2023-08-01Subjects: Get full text
Article -
165
Input Pattern Classification Based on the Markov Property of the IMBT with Related Equations and Contingency Tables
Published 2020-02-01Subjects: Get full text
Article -
166
Synthesis of combinational circuits by means of bi-decomposition of Boolean functions
Published 2022-03-01Subjects: Get full text
Article -
167
-
168
Oriented diameter and rainbow connection number of a graph
Published 2014-06-01Subjects: Get full text
Article -
169
Eccentricity of Networks with Structural Constraints
Published 2020-11-01Subjects: Get full text
Article -
170
A Characterization for 2-Self-Centered Graphs
Published 2018-02-01Subjects: “…generalized complete bipartite graphs (gcb)…”
Get full text
Article -
171
Complexity of Hamiltonian Cycle Reconfiguration
Published 2018-09-01Subjects: Get full text
Article -
172
-
173
Disimplicial arcs, transitive vertices, and disimplicial eliminations
Published 2015-09-01Subjects: “…bisimplicial edges of bipartite graphs…”
Get full text
Article -
174
A Study of Computational Genome Assembly by Graph Theory
Published 2024-01-01Subjects: Get full text
Article -
175
Joint User Association and Power Control in UAV Network: A Graph Theoretic Approach
Published 2024-02-01Subjects: Get full text
Article -
176
-
177
-
178
Relations between ordinary energy and energy of a self-loop graph
Published 2024-03-01“…Recently, it is proved that for a bipartite graph GS, E(GS)≥E(G). Here we show that this inequality is strict for an unbalanced bipartite graph GS with 0<α<n. …”
Get full text
Article -
179
A note on induced Turán numbers
Published 2021“…Their and subsequent work has focussed on $F$ being a complete bipartite graph. In this short note, we complement this focus by asymptotically determining the induced Turán number whenever $H$ is not bipartite and $F$ is not an independent set nor a complete bipartite graph.…”
Journal article -
180
Two families of chromatically unique graphs.
Published 1992“…In this paper, We prove that a graph (resp., a bipartite graph) obtained from K2,4 U P3 (s ≥ 3) (resp., K3,3 U P3 (s ≥ 7)) by identifying the end vertices of the path Ps with any two vertices of the complete bipartite graph K2,4 (resp., K3,3) is chromatically unique.…”
Get full text
Conference or Workshop Item