Open Access Helper

OpenAlex Citation Counts

OpenAlex Citations Logo

OpenAlex is a bibliographic catalogue of scientific papers, authors and institutions accessible in open access mode, named after the Library of Alexandria. It's citation coverage is excellent and I hope you will find utility in this listing of citing articles!

If you click the article title, you'll navigate to the article, as listed in CrossRef. If you click the Open Access links, you'll navigate to the "best Open Access location". Clicking the citation count will open this listing for that article. Lastly at the bottom of the page, you'll find basic pagination options.

Requested Article:

New Concepts on Vertex and Edge Coloring of Simple Vague Graphs
Arindam Dey, Lê Hoàng Sơn, Pranesh Kumar, et al.
Symmetry (2018) Vol. 10, Iss. 9, pp. 373-373
Open Access | Times Cited: 23

Showing 23 citing articles:

A Novel and Comprehensive Trust Estimation Clustering Based Approach for Large Scale Wireless Sensor Networks
Tayyab Khan, Karan Singh, Lê Hoàng Sơn, et al.
IEEE Access (2019) Vol. 7, pp. 58221-58240
Open Access | Times Cited: 114
Neutrosophic image segmentation with Dice Coefficients
Sudan Jha, Lê Hoàng Sơn, Raghvendra Kumar, et al.
Measurement (2018) Vol. 134, pp. 762-772
Closed Access | Times Cited: 66
Probability-based cluster head selection and fuzzy multipath routing for prolonging lifetime of wireless sensor networks
Harold Robinson, E. Golden Julie, Raghvendra Kumar, et al.
Peer-to-Peer Networking and Applications (2019) Vol. 12, Iss. 5, pp. 1061-1075
Closed Access | Times Cited: 58
Cubic Graphs and Their Application to a Traffic Flow Problem
G. Muhiuddin, M. Mohseni Takallo, Y. B. Jun, et al.
International Journal of Computational Intelligence Systems (2020) Vol. 13, Iss. 1, pp. 1265-1265
Open Access | Times Cited: 43
On derived t-path, t=2,3 signed graph and t-distance signed graph
Deepa Sinha, Sachin Somra
MethodsX (2025) Vol. 14, pp. 103160-103160
Open Access
An Effective Algorithm for Edge Coloring: Malatya Edge Coloring Algorithm
Furkan Öztemіz
Turkish Journal of Science and Technology (2025) Vol. 20, Iss. 1, pp. 309-325
Closed Access
Towards granular calculus of single-valued neutrosophic functions under granular computing
Nguyen Thi Kim Son, Nguyen Phuong Dong, Lê Hoàng Sơn, et al.
Multimedia Tools and Applications (2019) Vol. 79, Iss. 23-24, pp. 16845-16881
Closed Access | Times Cited: 26
Transportation Problem in Neutrosophic Environment
Jayanta Pratihar, Ranjan Kumar, Arindam Dey, et al.
Advances in data mining and database management book series (2019), pp. 180-212
Closed Access | Times Cited: 24
New Soft Set Based Class of Linear Algebraic Codes
Mumtaz Ali, Huma Khan, Lê Hoàng Sơn, et al.
Symmetry (2018) Vol. 10, Iss. 10, pp. 510-510
Open Access | Times Cited: 18
A Study of Regular and Irregular Neutrosophic Graphs with Real Life Applications
Liangsong Huang, Yu Hu, Yuxia Li, et al.
Mathematics (2019) Vol. 7, Iss. 6, pp. 551-551
Open Access | Times Cited: 13
New concepts of pentapartitioned neutrosophic graphs and applications for determining safest paths and towns in response to COVID-19
Shio Gai Quek, Ganeshsree Selvachandran, D. Ajay, et al.
Computational and Applied Mathematics (2022) Vol. 41, Iss. 4
Open Access | Times Cited: 6
Updating the Reduct in Fuzzy β-Covering via Matrix Approaches While Adding and Deleting Some Objects of the Universe
Jianxin Huang, Peiqiu Yu, Weikang Li
Information (2019) Vol. 11, Iss. 1, pp. 3-3
Open Access | Times Cited: 8
Preference Graph of Potential Method as a Fuzzy Graph
Siti Salwana Mamat, Siti Rahmah Awang, Tahir Ahmad
Advances in Fuzzy Systems (2020) Vol. 2020, pp. 1-14
Closed Access | Times Cited: 7
Optimal Core Operation in Supply Chain Finance Ecosystem by Integrating the Fuzzy Algorithm and Hierarchical Framework
Chun-Yueh Lin
International Journal of Computational Intelligence Systems (2020) Vol. 13, Iss. 1, pp. 259-259
Open Access | Times Cited: 7
Coordinated Formation Design of Multi-Robot Systems via an Adaptive-Gain Super-Twisting Sliding Mode Method
Dianwei Qian, Guigang Zhang, Jiarong Chen, et al.
Applied Sciences (2019) Vol. 9, Iss. 20, pp. 4315-4315
Open Access | Times Cited: 5
A Comparative Assessment of Graphic and 0–10 Rating Scales Used to Measure Entrepreneurial Competences
Laura Vall-llosera, Salvador Linares‐Mustarós, Andrea Bikfalvi, et al.
Axioms (2020) Vol. 9, Iss. 1, pp. 21-21
Open Access | Times Cited: 5
AVRM: adaptive void recovery mechanism to reduce void nodes in wireless sensor networks
A. Ayyasamy, E. Golden Julie, Harold Robinson, et al.
Peer-to-Peer Networking and Applications (2020) Vol. 13, Iss. 3, pp. 987-1001
Closed Access | Times Cited: 4
On the P3 Coloring of Graphs
Hong Yang, Muhammad Naeem, Shahid Qaisar
Symmetry (2023) Vol. 15, Iss. 2, pp. 521-521
Open Access | Times Cited: 1
Characterization of 2-Path Signed Network
Deepa Sinha, Deepakshi Sharma
Complexity (2020) Vol. 2020, pp. 1-13
Open Access | Times Cited: 3
On Uniquely 3-Colorable Plane Graphs without Adjacent Faces of Prescribed Degrees
Zepeng Li, Naoki Matsumoto, Enqiang Zhu, et al.
Mathematics (2019) Vol. 7, Iss. 9, pp. 793-793
Open Access | Times Cited: 2
A fuzzy incidence coloring to monitor traffic flow with minimal waiting time
V. Yamuna, K. Arun Prakash
Expert Systems with Applications (2021) Vol. 186, pp. 115664-115664
Closed Access | Times Cited: 1
An analysis between different algorithms for the graph vertex coloring problem
Velin Kralev, Radoslava Kraleva
International Journal of Power Electronics and Drive Systems/International Journal of Electrical and Computer Engineering (2023) Vol. 13, Iss. 3, pp. 2972-2972
Open Access
An Analysis of the Factors Influencing the Strong Chromatic Index of Graphs Derived by Inflating a Few Common Classes of Graphs
S.T. Vikram, S. Balaji
Symmetry (2023) Vol. 15, Iss. 7, pp. 1301-1301
Open Access
Mapping Oman's Artificial Intelligence Logistic Fuzzy Social Media Research Landscape Through Bibliometrics
Et al. Madhan N
International Journal on Recent and Innovation Trends in Computing and Communication (2023) Vol. 11, Iss. 9, pp. 4394-4403
Open Access
Page 1

Scroll to top