CFP last date
20 November 2026
Call for Paper
December Edition
IJCA solicits high quality original research papers for the upcoming December edition of the journal. The last date of research paper submission is 20 November 2026

Submit your paper
Know more
The week's pick
Responsive image
A Machine Learning-based Decision Framework for Demand Forecasting and Price Optimization in Competitive E-Commerce Environments

Aera K. Leboulluec Janhavi Datye
Random Articles
Reseach Article

Convolution Factorization Method in Graph Theory

by Bal Govind Shukla
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 187 - Number 146
Year of Publication: 2026
Authors: Bal Govind Shukla
10.5120/ijcab16c56d4e4ad

Bal Govind Shukla . Convolution Factorization Method in Graph Theory. International Journal of Computer Applications. 187, 146 ( Oct 2026), 10-13. DOI=10.5120/ijcab16c56d4e4ad

@article{ 10.5120/ijcab16c56d4e4ad,
author = { Bal Govind Shukla },
title = { Convolution Factorization Method in Graph Theory },
journal = { International Journal of Computer Applications },
issue_date = { Oct 2026 },
volume = { 187 },
number = { 146 },
month = { Oct },
year = { 2026 },
issn = { 0975-8887 },
pages = { 10-13 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume187/number146/convolution-factorization-method-in-graph-theory/ },
doi = { 10.5120/ijcab16c56d4e4ad },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2026-10-24T03:08:31.851106+05:30
%A Bal Govind Shukla
%T Convolution Factorization Method in Graph Theory
%J International Journal of Computer Applications
%@ 0975-8887
%V 187
%N 146
%P 10-13
%D 2026
%I Foundation of Computer Science (FCS), NY, USA
Abstract

In this work we investigate the relationship between complete bipartite graph theory and the convolution factorization method, with an emphasis on the applications of convolution-based methods to graph factorization, coloring, and edge distribution problems. Although convolution factorization is primarily utilized in mathematical analysis and signal processing, its concepts can also be applied to graph theory, especially when breaking down and examining entire bipartite graphs. This paper presents a comprehensive mathematical model that illustrates how graph-theoretical ideas can be handled using convolution techniques, with particular emphasis on applications such as network flow analysis, r-factorizations, and perfect matchings.

References
  1. Diestel, R. (2017). Graph Theory (5th ed.). Springer.https://doi.org/10.1007/978-3-662-53622-3
  2. Bollobás, B. (1998). Modern Graph Theory. Springer. https://doi.org/10.1007/978-1-4612-0619-4
  3. Bondy, J. A., &Murty, U. S. R. (2008). Graph Theory with Applications. Elsevier.
  4. West, D. B. (2001). Introduction to Graph Theory (2nd ed.). Prentice Hall.
  5. Ahuja, R. K., Magnanti, T. L., &Orlin, J. B. (1993). Network Flows: Theory, Algorithms, and Applications. Prentice Hall.
  6. Lovász, L., & Plummer, M. D. (1986). Matching Theory. Elsevier.
  7. J.A. Bondy, U.S.R. Murty, Graph Theory with Applications, Macmillan Press, London, Basingstoke, 1976.
  8. N. Martin, Complete bipartite factorisations by complete bipartite graphs, Discrete Math. 167/168 (1997) 461–480.
  9. K. Ushio, P3-factorizationof complete bipartite graphs, Discrete Math. 72 (1988) 361–366.
  10. K. Ushio, G-designs and related designs, Discrete Math. 116 (1993) 299–311.
  11. Ortega, P. Frossard, J. Kovačević, J. M. Moura and P. Vandergheynst, "Graph signal processing", 2017.
  12. J. Shi, M. Cheung, J. Du and J. M. F. Moura, "Classification with Vertex-Based Graph Convolutional Neural Networks", 2018 52nd Asilomar Conference on Signals Systems and Computers, pp. 752-756, Oct 2018.
  13. A. Sandryhaila and J. M. F. Moura, "Discrete signal processing on graphs", IEEE Trans. Signal Proc., vol. 61, no. 7, pp. 1644-1656, 2013.
  14. A. Sandryhaila and J. M. F. Moura, "Discrete signal processing on graphs: Frequency analysis", IEEE Trans. Signal Proc., vol. 62, no. 12, pp. 3042-3054, 2014.
  15. G. Leus, S. Segarra, A. Ribeiro and A. G. Marques, "The dual graph shift operator: Identifying the support of the frequency domain", 2017.
  16. J. Shi and J. M. F. Moura, "Graph signal processing: Modulation convolution and sampling", Submitted for publication. Our submission was on November 29 2019., November 2019.
Index Terms

Computer Science
Information Sciences

Keywords

Convolution factorization Bipartite Graphs 1-factors r-factors network design and combinatorial optimization

Powered by PhDFocusTM